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
281		Graph Implementation – Adjacency Matrix | Set 3	Beginner	%	1
282		Java Pair Class	Beginner	%	0
283		Graph Implementation – Adjacency List - Better| Set 2	Beginner	%	0
284		Minimum Copy Paste Operations	Medium	%	0
285		Count and print all Subarrays with product less than K in O(n)	Hard	%	0
286		Sliding Window Algorithm (Track the maximum of each subarray of size k)	Hard	%	0
287		Deque Implementation – Java	Beginner	%	0
288		Print all sub sequences of a given String	Medium	%	0
289		Graph – Print all paths between source and destination	Medium	%	1
290		Graph – Depth First Traversal	Medium	%	2
291		Print all sub sequences of a given array	Hard	%	0
292		Print all substrings of a given string	Medium	%	0
293		Sum of all sub arrays in O(n) Time	Hard	%	0
294		Print all subarrays of a given array	Medium	%	0
295		Text Justification Problem (OR Word Wrap Problem)	Hard	%	0
296		Dynamic Programming - Egg Dropping Problem	Hard	%	0
297		Nuts & Bolts Problem (Lock & Key problem)	Beginner	%	0
298		Divide and Conquer - Rearrange array elements in special order	Medium	%	0
299		Remove Duplicates from a string	Medium	%	0
300		Find median of two sorted arrays of same size	Medium	%	0
301		Dynamic programming – Minimum Jumps to reach to end	Hard	%	0
302		Dynamic programming – Printer Problem	Hard	%	0
303		Dynamic programming - Remove Boxes Problem	Hard	%	0
304		Find two non-repeating numbers in an array in O(n) time and O(1) space	Hard	%	1
305		Number of bit to be flipped to convert one number to another.	Beginner	%	1
306		Separate even and odd integers in a given array	Beginner	%	0
307		All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space	Hard	%	1
308		Find local minimum or local maximum in O(1).	Medium	%	0
309		Separate 0’s and 1’s in a given array	Beginner	%	0
310		Find three elements in an array that sum to a zero.	Beginner	%	0
311		Find three elements in an array that sum to a given value	Beginner	%	0
312		Majority Element- Boyer–Moore majority vote algorithm	Medium	%	0
313		Majority Element – Part 1	Beginner	%	0
314		Find the local minima in a given array	Medium	%	0
315		Check whether the given number is a perfect square	Beginner	%	0

Graph Implementation – Adjacency Matrix | Set 3

Java Pair Class

Graph Implementation – Adjacency List - Better| Set 2

Minimum Copy Paste Operations

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)

Deque Implementation – Java

Print all sub sequences of a given String

Graph – Print all paths between source and destination

Graph – Depth First Traversal

Print all sub sequences of a given array

Print all substrings of a given string

Sum of all sub arrays in O(n) Time

Print all subarrays of a given array

Text Justification Problem (OR Word Wrap Problem)

Dynamic Programming - Egg Dropping Problem

Nuts & Bolts Problem (Lock & Key problem)

Divide and Conquer - Rearrange array elements in special order

Remove Duplicates from a string

Find median of two sorted arrays of same size

Dynamic programming – Minimum Jumps to reach to end

Dynamic programming – Printer Problem

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.

Separate even and odd integers in a given array

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

Find local minimum or local maximum in O(1).

Separate 0’s and 1’s in a given array

Find three elements in an array that sum to a zero.

Find three elements in an array that sum to a given value

Majority Element- Boyer–Moore majority vote algorithm

Majority Element – Part 1

Find the local minima in a given array

Check whether the given number is a perfect square

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