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		Magic Index - Find Index In Sorted Array Such That A[i] = i.	Beginner	%	0
422		Find numbers that are palindrome in the decimal and octal Representations	Beginner	%	0
423		Find All the Well Ordered Permutations of a Given String.	Medium	%	0
424		Find the Increasing Triplet Sub-sequence in an array	Medium	%	0
425		Construct a Special Triangle from a Given Array	Beginner	%	0
426		Colorful Numbers	Hard	%	1
427		Goldbach's Conjecture	Beginner	%	0
428		Print All the Subsets of a Given Set (Power Set)	Hard	%	1
429		Convert Decimal into Irreducible Fraction	Beginner	%	0
430		Clock Angle Problem	Beginner	%	1
431		Print All Combinations of subset of size K from Given Array	Hard	%	0
432		Track the Maximum Element in a Stack.	Medium	%	1
433		Print All Possible Valid Combinations Of Parenthesis of Given 'N'	Hard	%	1
434		Graph Representation - Adjacency Matrix and Adjacency List	Beginner	%	2
435		Counting Sort	Medium	%	0
436		Towers Of Hanoi	Beginner	%	0
437		Generate All Strings of n bits.	Medium	%	1
438		Find The Missing Duplicate in a Given Array.	Beginner	%	1
439		Sort 3 Integers without using if condition OR use only Max() function.	Beginner	%	0
440		Euclidean algorithm - Greatest Common Divisor(GCD)	Beginner	%	0
441		Implement Queue Using Stacks	Medium	%	0
442		Alternate Splitting of a given Linked List	Medium	%	0
443		Reverse The Doubly Linked List	Medium	%	0
444		Swap Kth Node from the front with the Kth Node from the End	Medium	%	0
445		Print the Bottom View of the Binary Tree.	Medium	%	0
446		Delete X Nodes After Y Nodes In a Linked List	Beginner	%	0
447		Merge Sort in a Linked list	Medium	%	0
448		Merge a Linked list into another Linked List at Alternate Positions.	Medium	%	0
449		AVL Tree - Insertion	Hard	%	0
450		Construct a binary tree from given Inorder and Level Order Traversal	Hard	%	0
451		Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)	Hard	%	0
452		Construct Binary Search Tree from a given Preorder Traversal using Recursion	Hard	%	0
453		Print The Top View of a Binary Tree	Medium	%	0
454		Construct a Binary Tree from Given Inorder and Depth-First-Search.	Hard	%	0
455		Depth First Search/Traversal in Binary Tree	Beginner	%	0

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

Print All the Subsets of a Given Set (Power Set)

Convert Decimal into Irreducible Fraction

Clock Angle Problem

Print All Combinations of subset of size K from Given Array

Track the Maximum Element in a Stack.

Print All Possible Valid Combinations Of Parenthesis of Given 'N'

Graph Representation - Adjacency Matrix and Adjacency List

Counting Sort

Towers Of Hanoi

Generate All Strings of n bits.

Find The Missing Duplicate in a Given Array.

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

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

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