Problems

# Status Problem Level Completes Likes
246

Construct a binary tree from given Inorder and Level Order Traversal

Hard % 0
247

Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)

Hard % 0
248

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Hard % 0
251

Inorder Predecessor and Successor in Binary Search Tree

Hard % 0
252

Check if Array Contains All Elements Of Some Given Range

Medium % 0
253

Check if Array is Consecutive Integers

Beginner % 0
254

Find the subarray with sum to a Given Value.

Medium % 0
255

Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space

Hard % 0
256

Find intersection between Two Sorted Arrays.

Beginner % 0
257

Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].

Medium % 0
258

Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number.

Hard % 0
262

Find the Distance between Two Nodes of a Binary Tree.

Hard % 0
263

Find The Distance From Root To Given Node of a Binary Tree.

Medium % 0
265

Inorder Successor in Binary Tree

Medium % 0
268

Sorted Array to Binary Search Tree of Minimal Height

Medium % 0
269

In a Binary Tree, Create Linked Lists of all the nodes at each depth.

Hard % 0
270

Level Order Traversal, Print each level in separate line.

Medium % 0
271

Find whether a Given Binary Tree is Balanced?

Medium % 0
272

Find the Maximum Depth OR Height of a Binary Tree

Beginner % 0
273

Add two numbers represented by a linked list, Numbers are Stored in FORWARD order

Medium % 0
274

Add two numbers represented by a linked list, Numbers are Stored in REVERSE order

Medium % 0
275

Reverse a Linked List - Part 2

Beginner % 0
276

Swap Every Kth Node in a LinkedList

Medium % 0
277

Delete a Node in the Middle of a linked list, Given only access to that Node

Beginner % 0
278

Find the n'th Node from the end of a given Linked List

Beginner % 0
279

Remove Duplicates from an Unsorted Linked list

Beginner % 0
280

Check if one string is Rotation of another string

Beginner % 0

Construct a binary tree from given Inorder and Level Order Traversal

Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Inorder Predecessor and Successor in Binary Search Tree

Check if Array Contains All Elements Of Some Given Range

Check if Array is Consecutive Integers

Find the subarray with sum to a Given Value.

Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space

Find intersection between Two Sorted Arrays.

Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].

Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number.

Find the Distance between Two Nodes of a Binary Tree.

Find The Distance From Root To Given Node of a Binary Tree.

Inorder Successor in Binary Tree

Sorted Array to Binary Search Tree of Minimal Height

In a Binary Tree, Create Linked Lists of all the nodes at each depth.

Level Order Traversal, Print each level in separate line.

Find whether a Given Binary Tree is Balanced?

Find the Maximum Depth OR Height of a Binary Tree

Add two numbers represented by a linked list, Numbers are Stored in FORWARD order

Add two numbers represented by a linked list, Numbers are Stored in REVERSE order

Reverse a Linked List - Part 2

Swap Every Kth Node in a LinkedList

Delete a Node in the Middle of a linked list, Given only access to that Node

Find the n'th Node from the end of a given Linked List

Remove Duplicates from an Unsorted Linked list

Check if one string is Rotation of another string