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		Dijkstra's – Shortest Path Algorithm (SPT)	Hard	%	0
317		Replace all vowels with next consonant in a given string	Medium	%	0
318		Find the Area of a Triangle Using coordinates	Beginner	%	0
319		Java Program to find if Triangle can be formed using given 3 sides	Beginner	%	0
320		Find the Area of a Triangle Given Three Sides – Heron’s Formula	Beginner	%	0
321		Find Factorial of a given Number	Beginner	%	0
322		Reverse a String using Recursion	Beginner	%	0
323		Find Sum of all Digits of a Number	Beginner	%	0
324		Print maximum occurring character in a String	Beginner	%	0
325		Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation	Hard	%	0
326		Introduction to Minimum Spanning Tree (MST)	Medium	%	0
327		Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV)	Hard	%	0
328		Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key	Hard	%	0
329		Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix	Hard	%	0
330		Prim’s Algorithm - Minimum Spanning Tree (MST)	Hard	%	0
331		Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)	Hard	%	0
332		Disjoint Set | Union-Find Algorithm - Union by rank and path compression	Hard	%	0
333		Disjoint Set Data Structure - Union Find Algorithm	Hard	%	0
334		Graph – Find Number of non reachable vertices from a given vertex	Medium	%	0
335		Graph – Detect Cycle in a Directed Graph using colors	Hard	%	0
336		Graph – Detect Cycle in an Undirected Graph using DFS	Medium	%	0
337		Graph – Software Installation Problem	Medium	%	0
338		Java Pair Class	Beginner	%	0
339		Graph Implementation – Adjacency List - Better| Set 2	Beginner	%	0
340		Minimum Copy Paste Operations	Medium	%	0
341		Count and print all Subarrays with product less than K in O(n)	Hard	%	0
342		Sliding Window Algorithm (Track the maximum of each subarray of size k)	Hard	%	0
343		Deque Implementation – Java	Beginner	%	0
344		Print all sub sequences of a given String	Medium	%	0
345		Print all sub sequences of a given array	Hard	%	0
346		Print all substrings of a given string	Medium	%	0
347		Sum of all sub arrays in O(n) Time	Hard	%	0
348		Print all subarrays of a given array	Medium	%	0
349		Text Justification Problem (OR Word Wrap Problem)	Hard	%	0
350		Dynamic Programming - Egg Dropping Problem	Hard	%	0

Dijkstra's – Shortest Path Algorithm (SPT)

Replace all vowels with next consonant in a given string

Find the Area of a Triangle Using coordinates

Java Program to find if Triangle can be formed using given 3 sides

Find the Area of a Triangle Given Three Sides – Heron’s Formula

Find Factorial of a given Number

Reverse a String using Recursion

Find Sum of all Digits of a Number

Print maximum occurring character in a String

Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation

Introduction to Minimum Spanning Tree (MST)

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV)

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key

Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix

Prim’s Algorithm - Minimum Spanning Tree (MST)

Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)

Disjoint Set | Union-Find Algorithm - Union by rank and path compression

Disjoint Set Data Structure - Union Find Algorithm

Graph – Find Number of non reachable vertices from a given vertex

Graph – Detect Cycle in a Directed Graph using colors

Graph – Detect Cycle in an Undirected Graph using DFS

Graph – Software Installation Problem

Java Pair Class

Graph Implementation – Adjacency List - Better| Set 2

Minimum Copy Paste Operations

Count and print all Subarrays with product less than K in O(n)

Sliding Window Algorithm (Track the maximum of each subarray of size k)

Deque Implementation – Java

Print all sub sequences of a given String

Print all sub sequences of a given array

Print all substrings of a given string

Sum of all sub arrays in O(n) Time

Print all subarrays of a given array

Text Justification Problem (OR Word Wrap Problem)

Dynamic Programming - Egg Dropping Problem

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