## More Problems

- Introduction to Minimum Spanning Tree (MST)
- Dijkstra's – Shortest Path Algorithm (SPT)
- Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation
- Check If Given Undirected Graph is a tree
- Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap
- 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
- Graph – Depth First Search using Recursion
- Disjoint Set Data Structure - Union Find Algorithm

## Subscribe ( No Spam!!)

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

Join 1,417 other subscribers

## Recent Posts

- 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
- Duplicate even elements in an array
- Minimum Increments to make all array elements unique