Featured Lists
	Top 20 Problems on Dynamic programming		Top 10 Problems on Backtracking
	Top 20 Problems on Graph		Top 25 Problems on Trees

All Problems

#	Status	Problem	Level	Completes	Likes
456		Merge a Linked list into another Linked List at Alternate Positions.	Medium	%	0
457		AVL Tree - Insertion	Hard	%	0
458		Construct a binary tree from given Inorder and Level Order Traversal	Hard	%	0
459		Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)	Hard	%	0
460		Construct Binary Search Tree from a given Preorder Traversal using Recursion	Hard	%	0
461		Print The Top View of a Binary Tree	Medium	%	0
462		Construct a Binary Tree from Given Inorder and Depth-First-Search.	Hard	%	0
463		Depth First Search/Traversal in Binary Tree	Beginner	%	0
464		Inorder Predecessor and Successor in Binary Search Tree	Hard	%	0
465		Check if Array Contains All Elements Of Some Given Range	Medium	%	0
466		Check if Array is Consecutive Integers	Beginner	%	0
467		Find the subarray with sum to a Given Value.	Medium	%	0
468		In an Array, find the Smallest Subarray with Sum Greater than the Given Value	Medium	%	0
469		Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space	Hard	%	0
470		Find intersection between Two Sorted Arrays.	Beginner	%	0
471		Find Kth Smallest or Largest element in an Array.	Medium	%	0
472		Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].	Medium	%	0
473		Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number.	Hard	%	0
474		Search an Element in a Rotated Sorted Array	Medium	%	0
475		Print All The Nodes Which are X distance from the Given Node	Hard	%	0
476		Print All The Nodes Which are X distance from the Leaf Nodes	Medium	%	0
477		Print All The Nodes Which are X distance from the Root	Medium	%	0
478		Find the Distance between Two Nodes of a Binary Tree.	Hard	%	0
479		Find The Distance From Root To Given Node of a Binary Tree.	Medium	%	0
480		Construct a binary tree from given Inorder and Postorder Traversal	Hard	%	0
481		Print the Vertical Sum in binary Tree .	Medium	%	0
482		Print the Binary Tree in Vertical Order Path.	Medium	%	0
483		Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree).	Hard	%	0
484		Lowest Common Ancestor in a Binary Search Tree.	Medium	%	0
485		Make a Binary Tree from Given Inorder and Preorder Traveral.	Hard	%	0
486		Given a binary tree, find out the maximum sum of value from root to each leaf.	Medium	%	0
487		Reverse Alternate levels of a given Binary Tree.	Medium	%	0
488		Given a binary tree, Convert it into its Mirror Tree	Beginner	%	0
489		Given a binary tree, Print All the Nodes that don't have Siblings.	Beginner	%	0
490		Given a binary tree, Find the Maximum Path Sum between Any Two Leaves	Medium	%	0

Merge a Linked list into another Linked List at Alternate Positions.

AVL Tree - Insertion

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

Print The Top View of a Binary Tree

Construct a Binary Tree from Given Inorder and Depth-First-Search.

Depth First Search/Traversal in Binary Tree

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.

In an Array, find the Smallest Subarray with Sum Greater than the Given Value

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

Find intersection between Two Sorted Arrays.

Find Kth Smallest or Largest element in an Array.

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.

Search an Element in a Rotated Sorted Array

Print All The Nodes Which are X distance from the Given Node

Print All The Nodes Which are X distance from the Leaf Nodes

Print All The Nodes Which are X distance from the Root

Find the Distance between Two Nodes of a Binary Tree.

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

Construct a binary tree from given Inorder and Postorder Traversal

Print the Vertical Sum in binary Tree .

Print the Binary Tree in Vertical Order Path.

Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree).

Lowest Common Ancestor in a Binary Search Tree.

Make a Binary Tree from Given Inorder and Preorder Traveral.

Given a binary tree, find out the maximum sum of value from root to each leaf.

Reverse Alternate levels of a given Binary Tree.

Given a binary tree, Convert it into its Mirror Tree

Given a binary tree, Print All the Nodes that don't have Siblings.

Given a binary tree, Find the Maximum Path Sum between Any Two Leaves

• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8
• 9
• 10
• 11
• 12
• 13
• 14
• 15
• 16