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
246

Maximum Difference between two elements in array – Largest Gap Problem

Beginner % 0
247

Minimum number of guesses needed to find a specific number

Beginner % 0
248

Left Shift (<<) and Right Shift (>>) Operators

Beginner % 1
249

Dijkstra's – Shortest Path Algorithm (SPT)

Hard % 0
250

Replace all vowels with next consonant in a given string

Medium % 0
251

Find the Area of a Triangle Using coordinates

Beginner % 0
252

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

Beginner % 0
253

Convert Number to base 3 String Representation

Beginner % 1
254

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

Beginner % 0
255

Find Factorial of a given Number

Beginner % 0
256

Reverse a String using Recursion

Beginner % 0
257

Find Sum of all Digits of a Number

Beginner % 0
259

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

Hard % 0
260

Introduction to Minimum Spanning Tree (MST)

Medium % 0
261

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

Hard % 0
262

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

Hard % 0
263

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap

Hard % 1
264

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

Hard % 0
265

Prim’s Algorithm - Minimum Spanning Tree (MST)

Hard % 0
266

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

Hard % 0
267

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

Hard % 0
268

Disjoint Set Data Structure - Union Find Algorithm

Hard % 0
269

Graph – Count all paths between source and destination

Medium % 1
270

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

Medium % 0
271

Graph – Detect Cycle in a Directed Graph using colors

Hard % 0
272

Graph – Detect Cycle in an Undirected Graph using DFS

Medium % 0
273

Graph – Detect Cycle in a Directed Graph

Medium % 1
274

Graph – Software Installation Problem

Medium % 0
275

Snake and Ladder Problem

Hard % 1
276

Weighted Graph Implementation – JAVA

Beginner % 1
277

Graph – Depth First Search in Disconnected Graph

Medium % 1
278

Topological Sort

Medium % 1
279

Graph – Depth First Search using Recursion

Beginner % 1
280

Graph Implementation – Adjacency Matrix | Set 3

Beginner % 1

Maximum Difference between two elements in array – Largest Gap Problem

Minimum number of guesses needed to find a specific number

Left Shift (<<) and Right Shift (>>) Operators

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

Convert Number to base 3 String Representation

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

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 List and Min Heap

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 – Count all paths between source and destination

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 – Detect Cycle in a Directed Graph

Graph – Software Installation Problem

Snake and Ladder Problem

Weighted Graph Implementation – JAVA

Graph – Depth First Search in Disconnected Graph

Topological Sort

Graph – Depth First Search using Recursion

Graph Implementation – Adjacency Matrix | Set 3