314,552 interview questions from 6,000+ companies.
Design a personalized notification system that selects, ranks, and delivers the right pushes while controlling spam and latency.
Define how you would execute a reliable notification delivery initiative at scale, balancing delivery guarantees, risk, and stakeholder expectations.
Explain how you would execute a reliable fix for race conditions in a high-traffic booking flow without creating new failures.
Use Dijkstra’s algorithm with a priority queue to find the shortest path in a weighted graph with non-negative edges.
Count structurally unique BSTs storing values 1..n using dynamic programming and Catalan-style recurrence.
Design an ML driven coupon personalization system that selects and serves promotional offers across user journeys.
Use binary search twice to find the first and last occurrence of a target in a sorted array in O(log n) time.
Design an ML system that ranks restaurant pickups for delivery executives moving along a 1D road with changing order supply and courier state.
Use sliding window with frequency counts to find the shortest substring containing all characters of a target string.
Design an ML-driven parking slot booking system with multi-company inventory sharing, ranking, and booking decisions.
