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
316		Find the local minima in a given array	Medium	%	0
317		Check whether the given number is a perfect square	Beginner	%	0
318		Check if array is sorted using recursion	Beginner	%	0
319		Find the Index from which 0 starts	Beginner	%	0
320		Find the increasing OR decreasing point in an array	Beginner	%	0
321		Find the only element in array which appears only once	Beginner	%	1
322		Algorithm to calculate power(k,n).	Beginner	%	1
323		Find remainder without using modulo operator	Beginner	%	0
324		Swap two numbers without using extra variable	Beginner	%	0
325		Number of 1’s in bit representation of a number	Beginner	%	1
326		Stock Single Sell Problem - O(n) Solution	Hard	%	2
327		Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer	Hard	%	0
328		Maximum difference between two elements where larger element appears after the smaller element	Medium	%	0
329		Find the right most unset bit OR zero bit of a number	Beginner	%	1
330		Find the two repeating elements in a given array | 6 Approaches	Medium	%	1
331		Find the right most set bit of a number	Beginner	%	1
332		Find two elements whose sum is closest to zero	Medium	%	1
333		Find the element which appears maximum number of times in the array.	Medium	%	0
334		Find duplicates in an given array in O(n) time and O(1) extra space.	Medium	%	0
335		Find the last non repeating character in a given string.	Beginner	%	0
336		Find the last repeating character in a given string.	Beginner	%	0
337		Find the first non repeating character in a given string	Beginner	%	0
338		Find the first repeating character in a given string	Beginner	%	0
339		k-Nearest Neighbors	Hard	%	0
340		Find longest Snake sequence in a given matrix	Medium	%	1
341		Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it	Medium	%	1
342		Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix	Medium	%	1
343		Reverse the given Array without using built in function	Beginner	%	0
344		Print All Diagonals of a given matrix	Medium	%	1
345		Dynamic Programming - Edit Distance Problem	Hard	%	2
346		Dynamic Programming - Coin In a Line Game Problem	Hard	%	0
347		Dynamic Programming - Box Stacking Problem	Hard	%	0
348		Dynamic Programming - Split the String into Minimum number of Palindromes.	Hard	%	0
349		Dynamic Programming - Highway Billboard Problem	Hard	%	0
350		Dynamic Programming - Maximum Subarray Problem	Medium	%	0

Find the local minima in a given array

Check whether the given number is a perfect square

Check if array is sorted using recursion

Find the Index from which 0 starts

Find the increasing OR decreasing point in an array

Find the only element in array which appears only once

Algorithm to calculate power(k,n).

Find remainder without using modulo operator

Swap two numbers without using extra variable

Number of 1’s in bit representation of a number

Stock Single Sell Problem - O(n) Solution

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

Maximum difference between two elements where larger element appears after the smaller element

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

Find the two repeating elements in a given array | 6 Approaches

Find the right most set bit of a number

Find two elements whose sum is closest to zero

Find the element which appears maximum number of times in the array.

Find duplicates in an given array in O(n) time and O(1) extra space.

Find the last non repeating character in a given string.

Find the last repeating character in a given string.

Find the first non repeating character in a given string

Find the first repeating character in a given string

k-Nearest Neighbors

Find longest Snake sequence in a given matrix

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Reverse the given Array without using built in function

Print All Diagonals of a given matrix

Dynamic Programming - Edit Distance Problem

Dynamic Programming - Coin In a Line Game Problem

Dynamic Programming - Box Stacking Problem

Dynamic Programming - Split the String into Minimum number of Palindromes.

Dynamic Programming - Highway Billboard Problem

Dynamic Programming - Maximum Subarray Problem

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