# Status Problem video Level Completes Likes 368 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 347 Find the nearest building which has bike | Find nearest specific vertex from source in a graph. Hard % 0 335 Max Flow Problem – Introduction Hard % 0 334 Dijkstra Algorithm Implementation – TreeSet Hard % 0 322 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation Hard % 0 310 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap Hard % 0 303 Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation Hard % 0 297 Dijkstra's – Shortest Path Algorithm (SPT) Hard % 0 287 Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Implementation Hard % 0 286 Introduction to Minimum Spanning Tree (MST) Medium % 0 285 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV) Hard % 0 284 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key Hard % 0 283 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap Hard % 1 282 Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix Hard % 0 281 Prim’s Algorithm - Minimum Spanning Tree (MST) Hard % 0 280 Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard % 0 279 Disjoint Set | Union-Find Algorithm - Union by rank and path compression Hard % 0 278 Disjoint Set Data Structure - Union Find Algorithm Hard % 0 277 Graph – Count all paths between source and destination Medium % 1 276 Graph – Find Number of non reachable vertices from a given vertex Medium % 0 Max Flow Problem - Ford-Fulkerson Algorithm Find the nearest building which has bike | Find nearest specific vertex from source in a graph. Max Flow Problem – Introduction Dijkstra Algorithm Implementation – TreeSet Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation Dijkstra's – Shortest Path Algorithm (SPT) Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete 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 1 2 3
