# Status Problem video Level Completes Likes 553 Minimize Scheduling Headaches: Clone Yourself for Overlapping Events Hard % 0 548 Minimum Number of Halls Required for Lecture Scheduling Hard % 1 526 Maximum Surpasser in the given array Hard % 0 506 Maximum Bipartite Matching Problem Hard % 0 503 Minimum Deletions to make the occurrence of each character unique. Hard % 1 501 Valid Pickup and Delivery options Hard % 0 497 Minimum number of adjacent swaps to sort the given array Hard % 1 489 The number of cycles in a given array of integers. Hard % 0 478 Efficient Robot Problem - Find Minimum Trips Hard % 0 462 Stable Marriage Problem - Gale–Shapley Algorithm Hard % 0 449 Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS) Hard % 0 444 Articulation Points OR Cut Vertices in a Graph Hard % 0 442 Find the number of distinct Islands OR connected components. Hard % 0 441 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 0 426 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 421 Sort a given stack - Using Recursion Hard % 1 418 Social Network Problem Hard % 0 403 Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS) Hard % 0 399 Round Price Problem Hard % 0 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 Minimize Scheduling Headaches: Clone Yourself for Overlapping Events Minimum Number of Halls Required for Lecture Scheduling Maximum Surpasser in the given array Maximum Bipartite Matching Problem Minimum Deletions to make the occurrence of each character unique. Valid Pickup and Delivery options Minimum number of adjacent swaps to sort the given array The number of cycles in a given array of integers. Efficient Robot Problem - Find Minimum Trips Stable Marriage Problem - Gale–Shapley Algorithm Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS) Articulation Points OR Cut Vertices in a Graph Find the number of distinct Islands OR connected components. Print All Paths in Dijkstra's Shortest Path Algorithm Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Sort a given stack - Using Recursion Social Network Problem Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS) Round Price Problem 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) 1 2 3
