When do you use BFS versus DFS on a graph? — PhonePe interview
Reported in PhonePe 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 PhonePe interview loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in PhonePe interview loops. Pointer manipulation staple for junior coding interviews.
Reported in PhonePe interview loops. Foundational search algorithm with clear loop invariants and edge cases.
Reported in PhonePe interview loops. Classic array + hash map problem testing optimal time–space trade-offs.
Reported in Paytm interview loops. Security and networking question covering encryption, certificates, and performance.
Reported in Paytm interview loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in Paytm interview loops. HR negotiation question requiring research and flexible framing.
Reported in Paytm interview loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in Paytm interview loops. Sliding window pattern for substring problems with hash set or map tracking.
Reported in Paytm interview loops. Tree recursion warm-up that often leads to balanced-tree and diameter follow-ups.
Reported in Paytm interview loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in Paytm interview loops. Pointer manipulation staple for junior coding interviews.
Reported in Paytm interview loops. Foundational search algorithm with clear loop invariants and edge cases.
Reported in Paytm interview loops. Classic array + hash map problem testing optimal time–space trade-offs.
Reported in Zomato interview loops. Security and networking question covering encryption, certificates, and performance.