Pattern 22: LeetCode Interview Patterns24 sections · 736 units
Open in CourseQuiz: BFS for Shortest Path
Test your understanding
Check Your Understanding
Why is BFS preferred over DFS for finding the shortest word transformation?
- A.BFS uses less memory than DFS
- B.DFS cannot handle word transformations
- C.BFS is always faster than DFS
- D.BFS explores all paths at distance k before any path at distance k+1