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

Dynamic Programming - Minimum Coin Change Problem

Medium % 1
72

Introduction To Dynamic Programming - Fibonacci Series

Beginner % 1
73

Find the Deepest Node in a Binary Tree.

Medium % 1
76

Graph Representation - Adjacency Matrix and Adjacency List

Beginner % 2
77

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Hard % 0
78

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

Medium % 1
79

Convert a Sorted Doubly Linked List to Balanced BST.

Medium % 1
80

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

Medium % 0
81

In a Binary Tree, Check if two nodes are Cousins

Medium % 0
83

Find the Maximum Depth OR Height of a Binary Tree

Beginner % 1
84

Reverse a Linked List

Beginner % 0
85

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

Medium % 1
86

Converting to Non-Decreasing Array with One Change

Medium % 0
87

Maximum Depth of Valid Nested Parentheses in an arithmetic expression

Medium % 0
88

Maximum Surpasser in the given array

Hard % 0
89

Maximum CPU Load Problem in a jobs list

Medium % 1
90

Maximum overlaps in a given list of time intervals

Medium % 0
91

Override the compare function for Collections.sort method

Beginner % 0
92

Design a data structure for Candidate Voting Problem

Medium % 0
93

Design data structure for players and ranks

Medium % 0
94

Override the compare function for Arrays.sort method - Java

Beginner % 0
95

Calculate tax on income as per given tax brackets.

Beginner % 0
96

Minimum number of adjacent swaps to sort the given array

Hard % 1
97

Find the number of pairs with even XOR

Beginner % 0
98

The number of cycles in a given array of integers.

Hard % 0
99

Check if given sudoku is valid or not

Medium % 0
100

Find Election Winner

Beginner % 0
101

Sort the indexes of the array as per the elements of the array

Medium % 0
103

Find Lexicographically smallest or largest substring of size k

Beginner % 0
104

Largest word in dictionary by removing a few characters from the given string

Beginner % 0
105

Check if one string is a subsequence of another string.

Beginner % 0

Dynamic Programming - Minimum Coin Change Problem

Introduction To Dynamic Programming - Fibonacci Series

Find the Deepest Node in a Binary Tree.

Graph Representation - Adjacency Matrix and Adjacency List

Construct Binary Search Tree from a given Preorder Traversal using Recursion

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

Find the Maximum Depth OR Height of a Binary Tree

Reverse a Linked List

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

Converting to Non-Decreasing Array with One Change

Maximum Depth of Valid Nested Parentheses in an arithmetic expression

Maximum Surpasser in the given array

Maximum CPU Load Problem in a jobs list

Maximum overlaps in a given list of time intervals

Override the compare function for Collections.sort method

Design a data structure for Candidate Voting Problem

Design data structure for players and ranks

Override the compare function for Arrays.sort method - Java

Calculate tax on income as per given tax brackets.

Minimum number of adjacent swaps to sort the given array

Find the number of pairs with even XOR

The number of cycles in a given array of integers.

Check if given sudoku is valid or not

Find Election Winner

Sort the indexes of the array as per the elements of the array

Find Lexicographically smallest or largest substring of size k

Largest word in dictionary by removing a few characters from the given string

Check if one string is a subsequence of another string.