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
421		Sort Names by their Last Names.	Beginner	%	0
422		Backtracking - Rat In A Maze Puzzle	Hard	%	0
423		Backtracking - SUDOKU Solver	Hard	%	0
424		Introduction To Backtracking Programming	Beginner	%	0
425		Merge K Sorted Arrays	Hard	%	0
426		Find the Deepest Left Node in a Binary Tree.	Medium	%	0
427		Rearrange the Array of Given Range N, such that A[i]=i	Medium	%	0
428		Find the Max element in a Given Binary Tree	Beginner	%	0
429		Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node	Hard	%	0
430		Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number	Medium	%	0
431		Do the Reverse Level Order Traversal in a binary tree	Medium	%	0
432		Find the Height of a tree without using Recursion	Medium	%	0
433		Print All The Full Nodes in a Binary Tree	Beginner	%	0
434		Binary Min-Max Heap Implementation	Hard	%	0
435		Magic Index - Find Index In Sorted Array Such That A[i] = i.	Beginner	%	0
436		Find numbers that are palindrome in the decimal and octal Representations	Beginner	%	0
437		Find All the Well Ordered Permutations of a Given String.	Medium	%	0
438		Find the Increasing Triplet Sub-sequence in an array	Medium	%	0
439		Construct a Special Triangle from a Given Array	Beginner	%	0
440		Colorful Numbers	Hard	%	0
441		Goldbach's Conjecture	Beginner	%	0
442		Convert Decimal into Irreducible Fraction	Beginner	%	0
443		Print All Combinations of subset of size K from Given Array	Hard	%	0
444		Track the Maximum Element in a Stack.	Medium	%	0
445		Counting Sort	Medium	%	0
446		Towers Of Hanoi	Beginner	%	0
447		Sort 3 Integers without using if condition OR use only Max() function.	Beginner	%	0
448		Euclidean algorithm - Greatest Common Divisor(GCD)	Beginner	%	0
449		Implement Queue Using Stacks	Medium	%	0
450		Alternate Splitting of a given Linked List	Medium	%	0
451		Reverse The Doubly Linked List	Medium	%	0
452		Swap Kth Node from the front with the Kth Node from the End	Medium	%	0
453		Print the Bottom View of the Binary Tree.	Medium	%	0
454		Delete X Nodes After Y Nodes In a Linked List	Beginner	%	0
455		Merge Sort in a Linked list	Medium	%	0

Sort Names by their Last Names.

Backtracking - Rat In A Maze Puzzle

Backtracking - SUDOKU Solver

Introduction To Backtracking Programming

Merge K Sorted Arrays

Find the Deepest Left Node in a Binary Tree.

Rearrange the Array of Given Range N, such that A[i]=i

Find the Max element in a Given Binary Tree

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

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

Do the Reverse Level Order Traversal in a binary tree

Find the Height of a tree without using Recursion

Print All The Full Nodes in a Binary Tree

Binary Min-Max Heap Implementation

Magic Index - Find Index In Sorted Array Such That A[i] = i.

Find numbers that are palindrome in the decimal and octal Representations

Find All the Well Ordered Permutations of a Given String.

Find the Increasing Triplet Sub-sequence in an array

Construct a Special Triangle from a Given Array

Colorful Numbers

Goldbach's Conjecture

Convert Decimal into Irreducible Fraction

Print All Combinations of subset of size K from Given Array

Track the Maximum Element in a Stack.

Counting Sort

Towers Of Hanoi

Sort 3 Integers without using if condition OR use only Max() function.

Euclidean algorithm - Greatest Common Divisor(GCD)

Implement Queue Using Stacks

Alternate Splitting of a given Linked List

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 Sort in a Linked list

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