## More Problems

- Dijkstra's – Shortest Path Algorithm (SPT)
- Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation
- Check If Given Undirected Graph is a tree
- Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java…
- Minimum number of guesses needed to find a specific number
- Maximum number edges to make Acyclic Undirected/Directed Graph
- Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue…
- Dijkstra Algorithm Implementation – TreeSet and Pair Class
- Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution
- Depth-First Search (DFS) in 2D Matrix/2D-Array - Iterative Solution

## Subscribe ( No Spam!!)

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

Join 1,427 other subscribers

## Recent Posts

- Find Nth-term of an arithmetic progression
- Minimum time difference
- Find departure and destination cities from the itinerary
- Rank Array Elements
- Three Consecutive Odd Numbers
- Non-decreasing Array with one allowed change
- Duplicate zero’s without expanding the array.
- Maximum Depth of Valid Nested Parentheses
- Decimal to Binary
- Maximum Consecutive Ones