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
71

Stock Single Sell Problem - O(n) Solution

Hard % 2
72

Find longest Snake sequence in a given matrix

Medium % 1
73

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

Medium % 1
74

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

Medium % 1
75

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1
76

Shortest Range in K-sorted Lists

Hard % 1
77

Get the Sum of all left leaves in a Binary tree

Beginner % 1
78

Convert binary tree to its Sum tree

Medium % 1
79

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
80

Dynamic Programming - Maximum Product Cutting Problem.

Medium % 1
81

Dynamic Programming - Rod Cutting Problem

Medium % 1
82

Dynamic Programming - Coin Change Problem

Medium % 1
83

Dynamic Programming - Minimum Cost Path Problem

Medium % 1
84

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

Medium % 1
85

Dynamic Programming - Longest Increasing Subsequence

Medium % 1
86

Breadth-First Search/Traversal in a Graph.

Beginner % 1
87

Backtracking - Rat In A Maze Puzzle

Hard % 0
88

Dynamic Programming - Stairs Climbing Puzzle

Beginner % 1
89

Dynamic Programming - Minimum Coin Change Problem

Medium % 1
90

Find the Deepest Node in a Binary Tree.

Medium % 1
92

Generate All Strings of n bits.

Medium % 1
93

Find The Missing Duplicate in a Given Array.

Beginner % 1
94

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Hard % 0
95

Depth First Search/Traversal in Binary Tree

Beginner % 0
96

Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree.

Medium % 1
97

Convert a Sorted Doubly Linked List to Balanced BST.

Medium % 1
98

In a Binary Tree, Check if Two nodes has the same parent or are siblings

Medium % 0
99

In a Binary Tree, Check if two nodes are Cousins

Medium % 0
101

Get the Height of a Node in a Binary Tree

Medium % 0
102

Find Whether Two Strings are Permutation of each other

Beginner % 1
103

Reverse a Linked List

Beginner % 0
104

Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths

Medium % 1
105

Valid or Well Formed Parentheses | Part - 1

Medium % 0

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

Kadane's Algorithm - Maximum Subarray Problem

Shortest Range in K-sorted Lists

Get the Sum of all left leaves in a Binary tree

Convert binary tree to its Sum tree

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 Graph.

Backtracking - Rat In A Maze Puzzle

Dynamic Programming - Stairs Climbing Puzzle

Dynamic Programming - Minimum Coin Change Problem

Find the Deepest Node in a Binary Tree.

Generate All Strings of n bits.

Find The Missing Duplicate in a Given Array.

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Depth First Search/Traversal in Binary Tree

Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree.

Convert a Sorted Doubly Linked List to Balanced BST.

In a Binary Tree, Check if Two nodes has the same parent or are siblings

In a Binary Tree, Check if two nodes are Cousins

Get the Height of a Node in a Binary Tree

Find Whether Two Strings are Permutation of each other

Reverse a Linked List

Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths

Valid or Well Formed Parentheses | Part - 1