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