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:55
Graph traversal
Problem Score Companies Time Status
Level Order 300 21:12
Stepping Numbers 300 43:53
Capture Regions on Board 500
49:35
Word Search Board 500 39:43
Graph adhoc
Problem Score Companies Time Status
Convert Sorted List to Binary Search Tree 300
28:15
Shortest path
Problem Score Companies Time Status
Sum Of Fibonacci Numbers 300
41:48
Knight On Chess Board 300 54:52
Word Ladder I 600 46:50
Word Ladder II 800 56:44
Graph hashing
Problem Score Companies Time Status
Clone Graph 500 40:41
Click here to jump start your coding interview preparation