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		Get specific row K in a Pascal Triangle	Medium	%	0
37		Check if the given playlist of programs is valid	Beginner	%	1
38		Maximum meetings in one room	Medium	%	0
39		Find if any two intervals overlap in given intervals	Medium	%	0
40		Given an array, find the number of all pairs with odd sum.	Medium	%	0
41		Print all steps to convert one string to another string	Medium	%	0
42		Lexicographically next permutation With One swap	Medium	%	1
43		Given an array, find three-element sum closest to Zero	Medium	%	1
44		Check if the given binary tree is Full or not.	Beginner	%	1
45		Sort a given stack - Using Recursion	Hard	%	1
46		ZigZag OR Diagonal traversal in 2d array/Matrix using queue	Medium	%	0
47		String to Integer (AtoI - ASCII to Integer)	Beginner	%	1
48		Valid Multiple Parentheses	Medium	%	1
49		Find Largest and Smallest word in a given String	Beginner	%	0
50		Find no of reverse pairs in an array which is sorted in two parts in O(N)	Medium	%	1
51		Reverse the given String using Stack	Beginner	%	0
52		Snake and Ladder Problem	Hard	%	1
53		Graph – Depth First Traversal	Medium	%	2
54		Stock Single Sell Problem - O(n) Solution	Hard	%	2
55		Find longest Snake sequence in a given matrix	Medium	%	1
56		Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it	Medium	%	1
57		Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix	Medium	%	1
58		Shortest Range in K-sorted Lists	Hard	%	1
59		Get the Sum of all left leaves in a Binary tree	Beginner	%	1
60		Convert binary tree to its Sum tree	Medium	%	1
61		Tree Traversals	Beginner	%	1
62		Dynamic Programming — Longest Palindromic Subsequence	Hard	%	1
63		Dynamic Programming - Maximum Product Cutting Problem.	Medium	%	1
64		Dynamic Programming - Rod Cutting Problem	Medium	%	1
65		Dynamic Programming - Coin Change Problem	Medium	%	1
66		Dynamic Programming - Minimum Cost Path Problem	Medium	%	1
67		Dynamic Programming - Maximum size square sub-matrix with all 1s	Medium	%	1
68		Dynamic Programming - Longest Increasing Subsequence	Medium	%	1
69		Breadth-First Search/Traversal in a Binary Tree	Beginner	%	0
70		Dynamic Programming - Stairs Climbing Puzzle	Beginner	%	1

Get specific row K in a Pascal Triangle

Check if the given playlist of programs is valid

Maximum meetings in one room

Find if any two intervals overlap in given intervals

Given an array, find the number of all pairs with odd sum.

Print all steps to convert one string to another string

Lexicographically next permutation With One swap

Given an array, find three-element sum closest to Zero

Check if the given binary tree is Full or not.

Sort a given stack - Using Recursion

ZigZag OR Diagonal traversal in 2d array/Matrix using queue

String to Integer (AtoI - ASCII to Integer)

Valid Multiple Parentheses

Find Largest and Smallest word in a given String

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

Reverse the given String using Stack

Snake and Ladder Problem

Graph – Depth First Traversal

Stock Single Sell Problem - O(n) Solution

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

Shortest Range in K-sorted Lists

Get the Sum of all left leaves in a Binary tree

Convert binary tree to its Sum tree

Tree Traversals

Dynamic Programming — Longest Palindromic Subsequence

Dynamic Programming - Maximum Product Cutting Problem.

Dynamic Programming - Rod Cutting Problem

Dynamic Programming - Coin Change Problem

Dynamic Programming - Minimum Cost Path Problem

Dynamic Programming - Maximum size square sub-matrix with all 1s

Dynamic Programming - Longest Increasing Subsequence

Breadth-First Search/Traversal in a Binary Tree

Dynamic Programming - Stairs Climbing Puzzle

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