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		Construct the largest number from the given array.	Medium	%	0
317		Number of Intervals in which given value lies	Beginner	%	0
318		Activity Selection Problem	Medium	%	0
319		Find the sum of overlapping elements in two sets	Beginner	%	0
320		Given two coordinates, Print the line equation	Beginner	%	0
321		Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS)	Hard	%	0
322		Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm	Medium	%	0
323		Articulation Points OR Cut Vertices in a Graph	Hard	%	0
324		Determine the given routing number belong to which bank	Medium	%	0
325		Check if interval is covered in given coordinates	Medium	%	0
326		Check the completeness of given binary tree | Set 1 - Using Node Count	Medium	%	0
327		Find all the Armstrong numbers in the given range	Beginner	%	0
328		Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1.	Medium	%	0
329		Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS)	Hard	%	0
330		Given Graph - Remove a vertex and all edges connect to the vertex	Medium	%	0
331		Social Network Problem	Hard	%	0
332		Maximum number edges to make Acyclic Undirected/Directed Graph	Beginner	%	0
333		Evaluation of Prefix Expressions (Polish Notation) | Set 2	Medium	%	0
334		Breadth-First Search in Disconnected Graph	Medium	%	0
335		Check if Number is divisible by its digits	Beginner	%	0
336		Check if the given number is Armstrong number or not	Beginner	%	0
337		Evaluation of Prefix Expressions (Polish Notation) | Set 1	Medium	%	0
338		Minimum Boats Required to rescue people	Medium	%	0
339		Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem.	Medium	%	0
340		Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2	Medium	%	0
341		Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1	Medium	%	0
342		Find all the numbers in the range which has prime set bits.	Beginner	%	0
343		Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS)	Hard	%	0
344		Check if Arithmetic Expression contains duplicate parenthesis	Medium	%	0
345		Introduction to Bipartite Graphs OR Bigraphs	Medium	%	0
346		Reverse the Directed Graph	Beginner	%	0
347		Round Price Problem	Hard	%	0
348		Smallest Number after Removing K digits	Hard	%	0
349		Determine the order of Tests when tests have dependencies on each other	Medium	%	0
350		Implement Graph Using Map - Java	Medium	%	0

Construct the largest number from the given array.

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

Articulation Points OR Cut Vertices in a Graph

Determine the given routing number belong to which bank

Check if interval is covered in given coordinates

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.

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

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

Social Network Problem

Maximum number edges to make Acyclic Undirected/Directed Graph

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Breadth-First Search in Disconnected Graph

Check if Number is divisible by its digits

Check if the given number is Armstrong number or not

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Minimum Boats Required to rescue people

Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem.

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1

Find all the numbers in the range which has prime set bits.

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

Check if Arithmetic Expression contains duplicate parenthesis

Introduction to Bipartite Graphs OR Bigraphs

Reverse the Directed Graph

Round Price Problem

Smallest Number after Removing K digits

Determine the order of Tests when tests have dependencies on each other

Implement Graph Using Map - Java

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