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