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
36		Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution	Beginner	%	1
37		Given an array, Print sum of all subsets	Beginner	%	1
38		Lexicographically previous permutation With One swap	Medium	%	1
39		Hamming Distance between two given integers	Beginner	%	1
40		Print boundary of given matrix/2D array.	Beginner	%	1
41		Breadth-First Search (BFS) in 2D Matrix/2D-Array	Beginner	%	1
42		Check if the given binary tree is Full or not.	Beginner	%	1
43		Sort a given stack - Using Recursion	Hard	%	1
44		Number's Complement - 2 Approaches	Medium	%	1
45		Number of Islands	Medium	%	1
46		Reverse a Stack using recursion - In Place (Without using extra memory)	Hard	%	1
47		String to Integer (AtoI - ASCII to Integer)	Beginner	%	1
48		Monotone Increasing Digits	Medium	%	1
49		Count Set bits in a given Number	Beginner	%	1
50		Valid Multiple Parentheses	Medium	%	1
51		Reverse a given number – Java Code	Beginner	%	1
52		Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1	Hard	%	1
53		Multiply with power of 2 without using pow() or * operator	Beginner	%	1
54		Find Number of reverse pairs in an array	Hard	%	1
55		Check if Given Number is power of 2.	Beginner	%	1
56		Find no of reverse pairs in an array which is sorted in two parts in O(N)	Medium	%	1
57		Bubble Sort and Optimized Bubble Sort- Java Implementation	Beginner	%	1
58		Calculate Log2n without using built-in function	Beginner	%	1
59		Swap two numbers using Bitwise XOR Operator	Medium	%	1
60		Divide with power of 2 without using pow() or / operator	Beginner	%	1
61		Left Shift (<<) and Right Shift (>>) Operators	Beginner	%	1
62		Convert Number to base 3 String Representation	Beginner	%	1
63		Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap	Hard	%	1
64		Graph – Count all paths between source and destination	Medium	%	1
65		Graph – Detect Cycle in a Directed Graph	Medium	%	1
66		Snake and Ladder Problem	Hard	%	1
67		Weighted Graph Implementation – JAVA	Beginner	%	1
68		Graph – Depth First Search in Disconnected Graph	Medium	%	1
69		Topological Sort	Medium	%	1
70		Graph – Depth First Search using Recursion	Beginner	%	1

Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution

Given an array, Print sum of all subsets

Lexicographically previous permutation With One swap

Hamming Distance between two given integers

Print boundary of given matrix/2D array.

Breadth-First Search (BFS) in 2D Matrix/2D-Array

Check if the given binary tree is Full or not.

Sort a given stack - Using Recursion

Number's Complement - 2 Approaches

Number of Islands

Reverse a Stack using recursion - In Place (Without using extra memory)

String to Integer (AtoI - ASCII to Integer)

Monotone Increasing Digits

Count Set bits in a given Number

Valid Multiple Parentheses

Reverse a given number – Java Code

Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1

Multiply with power of 2 without using pow() or * operator

Find Number of reverse pairs in an array

Check if Given Number is power of 2.

Find no of reverse pairs in an array which is sorted in two parts in O(N)

Bubble Sort and Optimized Bubble Sort- Java Implementation

Calculate Log2n without using built-in function

Swap two numbers using Bitwise XOR Operator

Divide with power of 2 without using pow() or / operator

Left Shift (<<) and Right Shift (>>) Operators

Convert Number to base 3 String Representation

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap

Graph – Count all paths between source and destination

Graph – Detect Cycle in a Directed Graph

Snake and Ladder Problem

Weighted Graph Implementation – JAVA

Graph – Depth First Search in Disconnected Graph

Topological Sort

Graph – Depth First Search using Recursion

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