Interview preparation course


Graphs are very useful data structures to store states and transition information.  In this lesson, learn about graphs representations, their complexities, traversals of graphs like BFS, DFS, Topological sorting, and union and find algorithms.

Problems set

  1. Graph representations
  2. Depth First Search
  3. Breadth-First Search
  4. Topological sorting
  5. Dijkstra’s algorithm
  6. Union and Find method
  7. Connected components in a graph
  8. Islands in matrix
  9.  Number of Closed Islands
  10. Number of connections
  11. Create an itinerary

Leave a Reply

Your email address will not be published. Required fields are marked *