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
176		Count and print all Subarrays with product less than K in O(n)	Hard	%	0
177		Sliding Window Algorithm (Track the maximum of each subarray of size k)	Hard	%	0
178		Graph – Print all paths between source and destination	Medium	%	1
179		Print all sub sequences of a given array	Hard	%	0
180		Sum of all sub arrays in O(n) Time	Hard	%	0
181		Text Justification Problem (OR Word Wrap Problem)	Hard	%	0
182		Dynamic Programming - Egg Dropping Problem	Hard	%	0
183		Dynamic programming – Minimum Jumps to reach to end	Hard	%	0
184		Dynamic programming - Remove Boxes Problem	Hard	%	0
185		Find two non-repeating numbers in an array in O(n) time and O(1) space	Hard	%	1
186		Number of bit to be flipped to convert one number to another.	Beginner	%	1
187		All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space	Hard	%	1
188		Find the only element in array which appears only once	Beginner	%	1
189		Algorithm to calculate power(k,n).	Beginner	%	1
190		Number of 1’s in bit representation of a number	Beginner	%	1
191		Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer	Hard	%	0
192		Find the right most unset bit OR zero bit of a number	Beginner	%	1
193		Find the right most set bit of a number	Beginner	%	1
194		Find two elements whose sum is closest to zero	Medium	%	1
195		Find the first repeating character in a given string	Beginner	%	0
196		Print All Diagonals of a given matrix	Medium	%	1
197		Dynamic Programming - Coin In a Line Game Problem	Hard	%	0
198		Dynamic Programming - Box Stacking Problem	Hard	%	0
199		Dynamic Programming - Highway Billboard Problem	Hard	%	0
200		Dynamic Programming - Maximum Subarray Problem	Medium	%	0
201		Kadane's Algorithm - Maximum Subarray Problem	Medium	%	1
202		Swap Nodes in pairs in a Linked List by changing links	Medium	%	0
203		Convert BST to Greater Sum Tree	Medium	%	0
204		Reverse Alternative 'k' nodes in a Linked List.	Medium	%	0
205		Reverse a Linked List in groups of given size 'K'	Medium	%	0
206		Binary Tree-Postorder Traversal - Non Recursive Approach	Beginner	%	0
207		Binary Tree - Preorder Traversal - Non Recursive Approach	Beginner	%	0
208		Binary Tree-Inorder Traversal - Non Recursive Approach	Beginner	%	0
209		Delete the Binary Tree	Beginner	%	0
210		Find the Size of a Binary Tree without Recursion	Beginner	%	0

Count and print all Subarrays with product less than K in O(n)

Sliding Window Algorithm (Track the maximum of each subarray of size k)

Graph – Print all paths between source and destination

Print all sub sequences of a given array

Sum of all sub arrays in O(n) Time

Text Justification Problem (OR Word Wrap Problem)

Dynamic Programming - Egg Dropping Problem

Dynamic programming – Minimum Jumps to reach to end

Dynamic programming - Remove Boxes Problem

Find two non-repeating numbers in an array in O(n) time and O(1) space

Number of bit to be flipped to convert one number to another.

All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space

Find the only element in array which appears only once

Algorithm to calculate power(k,n).

Number of 1’s in bit representation of a number

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Find the right most unset bit OR zero bit of a number

Find the right most set bit of a number

Find two elements whose sum is closest to zero

Find the first repeating character in a given string

Print All Diagonals of a given matrix

Dynamic Programming - Coin In a Line Game Problem

Dynamic Programming - Box Stacking Problem

Dynamic Programming - Highway Billboard Problem

Dynamic Programming - Maximum Subarray Problem

Kadane's Algorithm - Maximum Subarray Problem

Swap Nodes in pairs in a Linked List by changing links

Convert BST to Greater Sum Tree

Reverse Alternative 'k' nodes in a Linked List.

Reverse a Linked List in groups of given size 'K'

Binary Tree-Postorder Traversal - Non Recursive Approach

Binary Tree - Preorder Traversal - Non Recursive Approach

Binary Tree-Inorder Traversal - Non Recursive Approach

Delete the Binary Tree

Find the Size of a Binary Tree without Recursion

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