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
Depth first search
Problem Score Companies Time Status
Largest Distance between nodes of a Tree 200
65:14
Graph traversal
Problem Score Companies Time Status
Level Order 300 23:09
Stepping Numbers 300 43:42
Capture Regions on Board 500
49:58
Word Search Board 500 40:47
Graph adhoc
Problem Score Companies Time Status
Convert Sorted List to Binary Search Tree 300
30:45
Shortest path
Problem Score Companies Time Status
Sum Of Fibonacci Numbers 300
40:43
Knight On Chess Board 300 55:26
Word Ladder I 600 49:13
Word Ladder II 800 60:09
Graph hashing
Problem Score Companies Time Status
Clone Graph 500 41:45
Click here to start solving coding interview questions