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 105 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. Introductory dynamic programming problem isomorphic to Fibonacci.
Reported in IBM USA engineering loops. Hash map plus doubly linked list problem bridging DSA and system components.
Reported in IBM USA engineering loops. Classic DP testing tabulation, space optimization, and item selection reconstruction.
Reported in IBM USA engineering loops. Graph algorithm for non-negative edge weights using priority queue.
Reported in IBM USA engineering loops. Foundational system design covering APIs, encoding, storage, and read-heavy scaling.
Reported in IBM USA engineering loops. System design testing token bucket, sliding window, and Redis coordination.
Reported in IBM USA engineering loops. Mid-to-senior design spanning WebSockets, message storage, and presence.
Reported in IBM USA engineering loops. Caching patterns for system design and backend performance tuning.
Reported in IBM USA engineering loops. Infrastructure design question covering L4/L7 balancers and health checks.
Reported in IBM USA engineering loops. Behavioral STAR question assessing collaboration and conflict resolution.
Reported in IBM USA engineering loops. Leadership behavioral question for senior and lead engineering tracks.