# Status Problem video Level Completes Likes 398 Smallest Number after Removing K digits Hard % 0 392 Reverse a Stack using recursion - In Place (Without using extra memory) Hard % 1 368 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 360 Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Hard % 0 359 Merge K sorted Linked List - Using Priority Queue Hard % 0 351 Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 Hard % 1 347 Find the nearest building which has bike | Find nearest specific vertex from source in a graph. Hard % 0 338 Find Number of reverse pairs in an array Hard % 1 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 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 Smallest Number after Removing K digits Reverse a Stack using recursion - In Place (Without using extra memory) Max Flow Problem - Ford-Fulkerson Algorithm Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Merge K sorted Linked List - Using Priority Queue Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 Find the nearest building which has bike | Find nearest specific vertex from source in a graph. Find Number of reverse pairs in an array 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 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) 1 2 3 4 5 6
