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