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
Bfs
Graph connectivity
Problem Score Companies Time Status
Commutable Islands New 200 60:20
Black Shapes 300 37:43
Capture Regions on Board 500
49:11
Depth first search
Problem Score Companies Time Status
Largest Distance between nodes of a Tree New 200
67:07
Graph traversal
Problem Score Companies Time Status
Level Order 300 21:07
Stepping Numbers 300 44:09
Capture Regions on Board 500
49:11
Word Search Board 500 40:07
Graph adhoc
Problem Score Companies Time Status
Convert Sorted List to Binary Search Tree 300
28:03
Shortest path
Problem Score Companies Time Status
Sum Of Fibonacci Numbers 300
42:06
Knight On Chess Board 300 56:04
Word Ladder I 600 47:12
Word Ladder II 800 56:24
Graph hashing
Problem Score Companies Time Status
Clone Graph 500 41:22
Click here to jump start your coding interview preparation