Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Top 10 Interview Questions on Depth First Search (DFS)

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking. Here are some important DFS problems asked in Technical Interviews: 
 

  1. Find number of islands
  2. Transitive closure of a graph using DFS
  3. Application of DFS
  4. Detect cycle in an undirected graph
  5. Longest path between any pair of vertices
  6. Find a mother vertex in a graph
  7. Iterative Depth first traversal
  8. Print all path from a given source to a destination
  9. Stepping Number
  10. Maximum product of two non- intersecting paths in a tree

All articles on Depth First Search 



 

 



Article Tags :
DSA
Graph
Recommended Articles
1. Depth First Search or DFS for disconnected Graph
2. Applications, Advantages and Disadvantages of Depth First Search (DFS)
3. Depth First Search or DFS for a Graph
4. Time and Space Complexity of Depth First Search (DFS)
5. Depth First Traversal ( DFS ) on a 2D array
6. Iterative Deepening Search(IDS) or Iterative Deepening Depth First Search(IDDFS)
7. Iterative Depth First Traversal of Graph
8. Best First Search (Informed Search)
9. Check if a graph is strongly connected | Set 1 (Kosaraju using DFS)
10. Subtree of all nodes in a tree using DFS
11. Check if the given permutation is a valid DFS of graph
12. Check if a given graph is Bipartite using DFS
13. Print the DFS traversal step-wise (Backtracking also)
14. Queries for DFS of a subtree in a tree
15. Queries for M-th node in the DFS of subtree
16. Tree, Back, Edge and Cross Edges in DFS of Graph
17. Level with maximum number of nodes using DFS in a N-ary tree
18. Printing pre and post visited times in DFS of a graph
19. Minimum number of edges between two vertices of a graph using DFS
20. Find the Kth node in the DFS traversal of a given subtree in a Tree
21. Print all leaf nodes of an n-ary tree using DFS
22. Construct the Rooted tree by using start and finish time of its DFS traversal
23. Illustrate the difference in peak memory consumption between DFS and BFS
24. Print the path between any two nodes of a tree | DFS
25. Implementation of DFS using adjacency matrix