Level 8

Graphs

Previous Next
  • 1. Introduction to graphs
  • 2. Properties of graph
  • 3. Graph Traversals ( DFS and BFS )
  • 4. Example implementation of BFS and DFS
Graph connectivity
Problem Score Companies Time Status
Black Shapes 300 37:17
Capture Regions on Board 500
49:31
Graph traversal
Problem Score Companies Time Status
Level Order 300 20:46
Stepping Numbers 300 44:10
Capture Regions on Board 500
49:31
Word Search Board 500 40:09
Bfs
Problem Score Companies Time Status
Level Order 300 20:46
Smallest Multiple With 0 and 1 300 71:50
Shortest path
Problem Score Companies Time Status
Knight On Chess Board 300 55:34
Sum Of Fibonacci Numbers 300
42:15
Word Ladder I 600 47:36
Word Ladder II 800 55:54
Graph adhoc
Problem Score Companies Time Status
Convert Sorted List to Binary Search Tree 300
27:30
Graph hashing
Problem Score Companies Time Status
Clone Graph 500 39:46
Click here to jump start your coding interview preparation