Back to Topics
Graph
44 questions in this topic
| # | Status | Problem | Difficulty | Marks | Save | Notes | Revision |
|---|---|---|---|---|---|---|---|
| 1 |
Create a Graph, print it
|
Hard | 0 | ||||
| 2 |
Create a Graph (for practice)
|
Hard | 0 | ||||
| 3 |
Implement BFS algorithm
|
Medium | 0 | ||||
| 4 |
Implement DFS Algo
|
Medium | 0 | ||||
| 5 |
Detect Cycle in Directed Graph using BFS/DFS Algo
|
Hard | 0 | ||||
| 6 |
Detect Cycle in UnDirected Graph using BFS/DFS Algo
|
Hard | 0 | ||||
| 7 |
Search in a Maze
|
Medium | 0 | ||||
| 8 |
Minimum Step by Knight
|
Medium | 0 | ||||
| 9 |
flood fill algo
|
Medium | 0 | ||||
| 10 |
Clone a graph
|
Hard | 0 | ||||
| 11 |
Making wired Connections
|
Medium | 0 | ||||
| 12 |
word Ladder
|
Medium | 0 | ||||
| 13 |
Dijkstra algo
|
Medium | 0 | ||||
| 14 |
Implement Topological Sort
|
Medium | 0 | ||||
| 15 |
Minimum time taken by each job to be completed given by a Directed Acyclic Graph
|
Hard | 0 | ||||
| 16 |
Find whether it is possible to finish all tasks or not from given dependencies
|
Medium | 0 | ||||
| 17 |
Find the no. of Islands
|
Medium | 0 | ||||
| 18 |
Given a sorted Dictionary of an Alien Language, find order of characters
|
Medium | 0 | ||||
| 19 |
Implement Kruskal’s Algorithm
|
Medium | 0 | ||||
| 20 |
Implement Prim’s Algorithm
|
Medium | 0 | ||||
| 21 |
Total no. of Spanning tree in a graph
|
Hard | 0 | ||||
| 22 |
Implement Bellman Ford Algorithm
|
Hard | 0 | ||||
| 23 |
Implement Floyd Warshall Algorithm
|
Hard | 0 | ||||
| 24 |
Travelling Salesman Problem
|
Hard | 0 | ||||
| 25 |
Graph Colouring Problem
|
Hard | 0 | ||||
| 26 |
Snake and Ladders Problem
|
Medium | 0 | ||||
| 27 |
Find bridge in a graph
|
Hard | 0 | ||||
| 28 |
Count Strongly connected Components(Kosaraju Algo)
|
Medium | 0 | ||||
| 29 |
Check whether a graph is Bipartite or Not
|
Hard | 0 | ||||
| 30 |
Detect Negative cycle in a graph
|
Hard | 0 | ||||
| 31 |
Longest path in a Directed Acyclic Graph
|
Hard | 0 | ||||
| 32 |
Journey to the Moon
|
Medium | 0 | ||||
| 33 |
Cheapest Flights Within K Stops
|
Hard | 0 | ||||
| 34 |
Oliver and the Game
|
Medium | 0 | ||||
| 35 |
Water Jug problem using BFS
|
Medium | 0 | ||||
| 36 |
Find if there is a path of more thank length from a source
|
Medium | 0 | ||||
| 37 |
M-Colouring Problem
|
Medium | 0 | ||||
| 38 |
Minimum edges to reverse to make path from source to destination
|
Easy | 0 | ||||
| 39 |
Paths to travel each nodes using each edge(Seven Bridges)
|
Medium | 0 | ||||
| 40 |
Vertex Cover Problem
|
Medium | 0 | ||||
| 41 |
Chinese Postman or Route Inspection
|
Medium | 0 | ||||
| 42 |
Number of Triangles in a Directed and Undirected Graph
|
Hard | 0 | ||||
| 43 |
Minimise the cashflow among a given set of friends who have borrowed money from each other
|
Medium | 0 | ||||
| 44 |
Two Clique Problem
|
Medium | 0 |