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
176

Given an array, find all unique subsets with a given sum with allowed repeated digits.

Medium % 0
178

Find all subsets of size K from a given number N (1 to N)

Medium % 0
179

Sum of distinct elements among two given sets

Beginner % 0
180

Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed

Medium % 0
181

Stable Marriage Problem - Gale–Shapley Algorithm - Java

Hard % 0
182

Construct the largest number from the given array.

Medium % 0
184

Given an array, print all unique subsets with a given sum.

Medium % 0
185

Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K.

Medium % 0
186

Replace array elements with maximum element on the right.

Medium % 0
187

Find all unique combinations of numbers (from 1 to 9 ) with sum to N

Medium % 0
188

Number of Intervals in which given value lies

Beginner % 0
189

Activity Selection Problem

Medium % 0
190

Find the sum of overlapping elements in two sets

Beginner % 0
191

Given two coordinates, Print the line equation

Beginner % 0
192

Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS)

Hard % 0
193

Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm

Medium % 0
194

Check If Given Undirected Graph is a tree

Medium % 0
195

Articulation Points OR Cut Vertices in a Graph

Hard % 0
196

Check the completeness of given binary tree | Set 2 - Using Level Order Traversal

Medium % 0
197

Find the number of distinct Islands OR connected components.

Hard % 0
199

Determine the given routing number belong to which bank

Medium % 0
200

Check if interval is covered in given coordinates

Medium % 0
201

Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N

Medium % 0
202

Depth-First Search (DFS) in 2D Matrix/2D-Array - Iterative Solution

Beginner % 0
203

Check the completeness of given binary tree | Set 1 - Using Node Count

Medium % 0
204

Find all the Armstrong numbers in the given range

Beginner % 0
205

Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1.

Medium % 0
206

Number of Islands using BFS

Medium % 0
207

Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS)

Hard % 0
208

Check if given undirected graph is connected or not

Beginner % 0
209

Given Graph - Remove a vertex and all edges connect to the vertex

Medium % 0

Given an array, find all unique subsets with a given sum with allowed repeated digits.

Find all subsets of size K from a given number N (1 to N)

Sum of distinct elements among two given sets

Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed

Stable Marriage Problem - Gale–Shapley Algorithm - Java

Construct the largest number from the given array.

Given an array, print all unique subsets with a given sum.

Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K.

Replace array elements with maximum element on the right.

Find all unique combinations of numbers (from 1 to 9 ) with sum to N

Number of Intervals in which given value lies

Activity Selection Problem

Find the sum of overlapping elements in two sets

Given two coordinates, Print the line equation

Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS)

Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm

Check If Given Undirected Graph is a tree

Articulation Points OR Cut Vertices in a Graph

Check the completeness of given binary tree | Set 2 - Using Level Order Traversal

Find the number of distinct Islands OR connected components.

Determine the given routing number belong to which bank

Check if interval is covered in given coordinates

Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N

Depth-First Search (DFS) in 2D Matrix/2D-Array - Iterative Solution

Check the completeness of given binary tree | Set 1 - Using Node Count

Find all the Armstrong numbers in the given range

Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1.

Number of Islands using BFS

Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS)

Check if given undirected graph is connected or not

Given Graph - Remove a vertex and all edges connect to the vertex