When do you use BFS versus DFS on a graph? — IBM interview
Reported in IBM USA engineering loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Interview atlas
Explore 28 curated Q&As across 1 employers — filter by career stage, round, or company.
Filtered IBM ×
Reported in IBM USA engineering loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in IBM USA engineering loops. Tree recursion warm-up that often leads to balanced-tree and diameter follow-ups.
Reported in IBM USA engineering loops. Sliding window pattern for substring problems with hash set or map tracking.
Reported in IBM USA engineering loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in IBM USA engineering loops. HR negotiation question requiring research and flexible framing.
Reported in IBM USA engineering loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in IBM USA engineering loops. Security and networking question covering encryption, certificates, and performance.
Reported in IBM USA engineering loops. Recruiter or HR question about logistics, time zones, and loop structure.
Reported in IBM USA engineering loops. Classic array + hash map problem testing optimal time–space trade-offs.
Reported in IBM USA engineering loops. Foundational search algorithm with clear loop invariants and edge cases.
Reported in IBM USA engineering loops. Pointer manipulation staple for junior coding interviews.
Reported in IBM interview loops. Array prefix-suffix pattern often asked in coding rounds.
Reported in IBM interview loops. Hash set based linear-time approach for sequence detection.
Reported in IBM interview loops. Heap and selection strategy question with multiple valid approaches.
Reported in IBM interview loops. Topological sort and directed cycle detection interview staple.