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
211		Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number	Hard	%	0
212		Dynamic Programming - Longest Common Substring	Medium	%	0
213		Dynamic Programming - Longest Common Subsequence	Medium	%	0
214		Print All N Length Strings from Given Number K	Hard	%	0
215		Print All Possible Subsets with Sum equal to a given Number	Hard	%	0
216		Dynamic Programming - Subset Sum Problem	Hard	%	0
217		The Word Break Problem	Hard	%	0
218		Backtracking - Knight's Tour Problem	Hard	%	0
219		Backtracking - Search a Word In a Matrix	Hard	%	0
220		Backtracking - N Queens Problem - Better Solution	Hard	%	0
221		Find the Second Largest Element in an Array	Beginner	%	1
222		Breadth-First Search/Traversal in a Graph.	Beginner	%	1
223		Backtracking - Rat In A Maze Puzzle	Hard	%	0
224		Backtracking - SUDOKU Solver	Hard	%	0
225		Merge K Sorted Arrays	Hard	%	0
226		Find a Number occurring odd number of times in a Given array	Beginner	%	1
227		Find a Missing Number From a Sequence of Consecutive Numbers | XOR Method	Beginner	%	1
228		Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node	Hard	%	0
229		Check If One Binary is Mirror Tree of another Binary Tree.	Beginner	%	1
230		Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number	Medium	%	0
231		Print All The Full Nodes in a Binary Tree	Beginner	%	0
232		Clock Angle Problem	Beginner	%	1
233		Print All Combinations of subset of size K from Given Array	Hard	%	0
234		Generate All Strings of n bits.	Medium	%	1
235		Find The Missing Duplicate in a Given Array.	Beginner	%	1
236		Reverse The Doubly Linked List	Medium	%	0
237		Swap Kth Node from the front with the Kth Node from the End	Medium	%	0
238		Print the Bottom View of the Binary Tree.	Medium	%	0
239		Delete X Nodes After Y Nodes In a Linked List	Beginner	%	0
240		Merge a Linked list into another Linked List at Alternate Positions.	Medium	%	0
241		Construct a binary tree from given Inorder and Level Order Traversal	Hard	%	0
242		Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)	Hard	%	0
243		Print The Top View of a Binary Tree	Medium	%	0
244		Construct a Binary Tree from Given Inorder and Depth-First-Search.	Hard	%	0
245		Depth First Search/Traversal in Binary Tree	Beginner	%	0

Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number

Dynamic Programming - Longest Common Substring

Dynamic Programming - Longest Common Subsequence

Print All N Length Strings from Given Number K

Print All Possible Subsets with Sum equal to a given Number

Dynamic Programming - Subset Sum Problem

The Word Break Problem

Backtracking - Knight's Tour Problem

Backtracking - Search a Word In a Matrix

Backtracking - N Queens Problem - Better Solution

Find the Second Largest Element in an Array

Breadth-First Search/Traversal in a Graph.

Backtracking - Rat In A Maze Puzzle

Backtracking - SUDOKU Solver

Merge K Sorted Arrays

Find a Number occurring odd number of times in a Given array

Find a Missing Number From a Sequence of Consecutive Numbers | XOR Method

Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node

Check If One Binary is Mirror Tree of another Binary Tree.

Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number

Print All The Full Nodes in a Binary Tree

Clock Angle Problem

Print All Combinations of subset of size K from Given Array

Generate All Strings of n bits.

Find The Missing Duplicate in a Given Array.

Reverse The Doubly Linked List

Swap Kth Node from the front with the Kth Node from the End

Print the Bottom View of the Binary Tree.

Delete X Nodes After Y Nodes In a Linked List

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

Construct a binary tree from given Inorder and Level Order Traversal

Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without 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

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