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