# Status Problem video Level Completes Likes 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 328 Heap Sort Medium % 0 325 Find no of reverse pairs in an array which is sorted in two parts in O(N) Medium % 1 322 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation Hard % 0 317 Check if given number is Prime - O(√N) Solution Medium % 0 316 Print First N Prime Numbers Beginner % 0 310 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap Hard % 0 307 Swap two numbers using Bitwise XOR Operator Medium % 1 303 Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation Hard % 0 302 Fizz Buzz Challenge Beginner % 0 297 Dijkstra's – Shortest Path Algorithm (SPT) Hard % 0 285 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV) Hard % 0 280 Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard % 0 277 Graph – Count all paths between source and destination Medium % 1 275 Graph – Detect Cycle in a Directed Graph using colors Hard % 0 274 Graph – Detect Cycle in an Undirected Graph using DFS Medium % 0 271 Snake and Ladder Problem Hard % 1 269 Graph – Depth First Search in Disconnected Graph Medium % 1 Find Number of reverse pairs in an array Max Flow Problem – Introduction Dijkstra Algorithm Implementation – TreeSet Heap Sort Find no of reverse pairs in an array which is sorted in two parts in O(N) Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation Check if given number is Prime - O(√N) Solution Print First N Prime Numbers Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap Swap two numbers using Bitwise XOR Operator Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation Fizz Buzz Challenge Dijkstra's – Shortest Path Algorithm (SPT) Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV) Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Graph – Count all paths between source and destination Graph – Detect Cycle in a Directed Graph using colors Graph – Detect Cycle in an Undirected Graph using DFS Snake and Ladder Problem Graph – Depth First Search in Disconnected Graph 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
