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
64:34
Graph traversal
Problem Score Companies Time Status
Level Order 300 22:32
Stepping Numbers 300 43:30
Capture Regions on Board 500
50:44
Word Search Board 500 40:55
Graph adhoc
Problem Score Companies Time Status
Convert Sorted List to Binary Search Tree 300
30:14
Shortest path
Problem Score Companies Time Status
Sum Of Fibonacci Numbers 300
40:45
Knight On Chess Board 300 55:21
Word Ladder I 600 48:36
Word Ladder II 800 59:46
Graph hashing
Problem Score Companies Time Status
Clone Graph 500 41:43
Click here to start solving coding interview questions