DFS explores one path completely before backtracking, naturally suited for exhaustive search and connectivity problems. The pattern clicks when you realize each recursive call handles a smaller subgraph.
You'll reach for DFS when exploring all paths, detecting cycles, or processing dependencies. If you can explain these concepts in your own words, you'll solve related problems faster under interview pressure.