When do you use BFS versus DFS on a graph? — Swiggy interview
Reported in Swiggy interview loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Interview atlas
Explore 2,994 curated Q&As across 124 employers — filter by career stage, round, or company.
Reported in Swiggy interview loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in Swiggy interview loops. Pointer manipulation staple for junior coding interviews.
Reported in Swiggy interview loops. Foundational search algorithm with clear loop invariants and edge cases.
Reported in Swiggy interview loops. Classic array + hash map problem testing optimal time–space trade-offs.
Reported in Flipkart interview loops. Security and networking question covering encryption, certificates, and performance.
Reported in Flipkart interview loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in Flipkart interview loops. HR negotiation question requiring research and flexible framing.
Reported in Flipkart interview loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in Flipkart interview loops. Sliding window pattern for substring problems with hash set or map tracking.
Reported in Flipkart interview loops. Tree recursion warm-up that often leads to balanced-tree and diameter follow-ups.
Reported in Flipkart interview loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in Flipkart interview loops. Pointer manipulation staple for junior coding interviews.
Reported in Flipkart interview loops. Foundational search algorithm with clear loop invariants and edge cases.
Reported in Flipkart interview loops. Classic array + hash map problem testing optimal time–space trade-offs.
Reported in Deloitte interview loops. Security and networking question covering encryption, certificates, and performance.