Interview experience
Blinkit Interview Questions and Answers (2026)
Overview
Section titled “Overview”Blinkit’s fresher SDE loop is a 4-5 stage process where DSA problems and system-design questions are consistently framed around its 10-minute quick-commerce model - dark-store routing, inventory sync, delivery SLAs.
Blinkit interview process at a glance
Section titled “Blinkit interview process at a glance”| Round | Duration | What they test |
|---|---|---|
| Online Assessment | 90 min | 2-3 coding problems |
| Technical Round 1 | 45-60 min | DSA + project discussion |
| Technical Round 2 | 45-60 min | System design (orders / logistics) |
| HR | 20-30 min | Behavioural + culture fit |
Online Assessment
Section titled “Online Assessment”A 90-minute timed test with 2-3 medium-difficulty coding problems. Clean, fully-passing solutions beat partial cleverness - shortlist mail typically arrives within a few days.
Common questions
- Top-K frequent elements (heap or bucket sort)
- Shortest path in a grid (BFS)
- Merge overlapping delivery slots (interval merge)
Technical Round 1
Section titled “Technical Round 1”DSA-focused, with a detailed project discussion layered in - stack choices, your hardest bug, and what you’d rebuild given another shot.
Common questions
- Top-K frequent elements or grid-based shortest-path problems, live-coded
- Merge overlapping intervals (delivery slots, time windows)
- Your project’s architecture and the trade-offs you made
Technical Round 2
Section titled “Technical Round 2”System-design focused, scoped to Blinkit’s actual product - order flows, dark-store routing, and inventory-sync challenges rather than a generic prompt.
Common questions
- Design an inventory-sync system across multiple dark stores
- How would you route an order to the nearest available dark store?
- Discuss failure modes and simple bottleneck stories for a 10-minute-delivery SLA system
Round-by-round narratives are on the Blinkit interview experience page.
HR / Managerial round
Section titled “HR / Managerial round”A closing conversation on motivation, ambiguity, and culture fit - some drives run this as a separate managerial round before HR, others merge the two.
Common questions
- Tell me about yourself, and why Blinkit?
- How do you deal with ambiguity or fast-changing requirements when priorities shift overnight?
- Tell me about a time you had to trade off speed against correctness under pressure
- Comfort with on-call or weekend work, and relocation
Sample answer frameworks for each of these are on the Blinkit HR interview questions page.
Common technical interview questions and answers
Section titled “Common technical interview questions and answers”Q: How do you find the top K frequent elements in an array?
Count occurrences in a hash map first, then pick the K largest counts. With a min-heap of size K you push each (element, count) pair and pop whenever the heap exceeds K, giving O(n log K) time and O(n) space, which is the answer most interviewers expect. Bucket sort does better: create an array of lists indexed by frequency from 1 to n, drop each element into the bucket matching its count, and walk the buckets from the highest index down until you have collected K elements, which is O(n) time. Mention the heap first, then offer the bucket variant as the optimisation.
Q: How do you find the shortest path in a grid with obstacles?
Use breadth-first search, not DFS, because BFS explores in order of increasing distance so the first time it reaches the target that distance is minimal. Push the start cell into a queue with distance 0, and on each pop expand the four neighbouring cells that are inside the grid, not blocked, and not yet visited, marking them visited at enqueue time so a cell is never queued twice. Complexity is O(rows times columns) in both time and space. If cells have different traversal costs, BFS no longer suffices and you switch to Dijkstra with a priority queue, or 0-1 BFS with a deque when costs are only 0 or 1.
Q: How would you design inventory sync across multiple dark stores?
Make each dark store the authoritative owner of its own stock counts, and treat the customer-facing catalogue as a cached, eventually consistent view fed by an event stream of stock deltas. Every pick, receipt and cycle count publishes an event keyed by store and SKU so ordering per key is preserved, and consumers apply deltas rather than absolute values to avoid a stale snapshot overwriting a newer one. Reserve stock at checkout with a short-lived hold rather than decrementing at payment, so two customers cannot both buy the last unit, and release holds on timeout. Reconcile periodically against physical counts because shrinkage and mis-picks guarantee drift.
Q: How would you route an order to the nearest available dark store?
Nearest by straight-line distance is only the first filter. Index stores by geohash or an S2 cell so a lookup narrows candidates to a small set in milliseconds, then rank those candidates on a composite score: does the store actually hold every SKU in the cart, what is its current picking queue depth, how many riders are free, and what is the road-network travel time rather than the crow-flies distance. Prefer a single store that can fulfil the whole basket over splitting an order across two, since a split doubles the delivery cost and risks breaching the SLA. Fall back to the next-best store when the chosen one rejects the assignment.
Q: What failure modes would you plan for in a 10-minute delivery SLA system?
The common ones are stock that reads available but is physically missing, a dark store going offline mid-order, rider supply collapsing during a demand spike or rain, and a payment confirmation that times out after the order was actually created. Handle them with explicit degradation rather than errors: mark a store temporarily unavailable and re-route, hold rather than decrement inventory, make order creation idempotent on a client-supplied key so a retried payment does not double-order, and surface a realistic revised ETA instead of silently missing the promise. Track SLA breaches at the 95th and 99th percentile, because the average hides exactly the tail the customer notices.
Q: What is the difference between BFS and DFS, and when do you use each?
BFS explores level by level using a queue, so it finds the fewest-edge path in an unweighted graph and naturally computes distances from a source; its memory cost is proportional to the widest level, which can be large. DFS follows one branch to its end using a stack or recursion, uses memory proportional to the depth, and is the right tool for cycle detection, topological sort, connected components and backtracking problems. Both are O(V + E). For a delivery grid where you want the shortest route, BFS is correct and DFS is not, because DFS returns the first path it finds rather than the shortest one.
Q: How would you merge overlapping delivery time slots?
Sort slots by start time, then sweep with a single active slot. When the next slot starts at or before the active slot’s end, they overlap, so extend the active end to the maximum of the two ends; otherwise emit the active slot and make the next one active. Emit the final slot when the loop ends. That is O(n log n) for the sort plus O(n) for the sweep. A common follow-up is the maximum number of simultaneously active slots, which you solve differently - sort start and end events separately and sweep a counter, taking the peak, which tells you how many riders you need concurrently.
Q: How would you design an idempotent order-placement API?
The client generates an idempotency key once per checkout attempt and sends it with every retry. The server inserts that key into a table with a unique constraint inside the same transaction that creates the order, so a duplicate insert fails and you return the already-created order rather than creating a second one. This matters at Blinkit’s scale because mobile networks drop responses constantly and a customer tapping pay twice must not receive two deliveries. Store the response body against the key so retries return identical results, expire keys after a bounded window, and scope keys per user so different customers never collide.
Frequently asked questions about Blinkit interviews
Section titled “Frequently asked questions about Blinkit interviews”What is the Blinkit interview process for freshers?
Blinkit’s fresher SDE loop typically runs 4-5 stages: 1. Online Assessment (90 min) - 2-3 medium coding problems. 2. Technical Interview 1 (45-60 min) - DSA plus project discussion. 3. Technical Interview 2 (45-60 min) - system design scoped to orders/logistics. 4. Managerial round (some drives) - behavioural plus technical mix. 5. HR round (20-30 min) - final discussion. Total duration is roughly 2-3 weeks from application to offer.
What questions are asked in Blinkit interviews?
DSA questions commonly include top-K frequent elements (heap/bucket sort), shortest path in a grid (BFS), and merging overlapping delivery slots (interval merge). Technical rounds also probe domain concepts specific to Blinkit’s 10-minute delivery model - inventory sync across dark stores, delivery SLA constraints, and dark-store routing - in plain-language terms. Behavioural rounds check ownership, comfort with ambiguity, and why Blinkit.
How many rounds are there in the Blinkit interview?
Blinkit typically runs 4-5 stages: an Online Assessment, two Technical Interviews (DSA+project, then system design), sometimes a separate Managerial round, and an HR round. Some drives merge the managerial round into HR - confirm the exact structure from your placement cell.
What is the Blinkit technical interview like?
Technical Interview 1 (45-60 min) mixes DSA coding (top-K elements, grid BFS, interval merging) with a detailed project discussion - stack choices, hardest bug, what you’d rebuild. Technical Interview 2 shifts to system design scoped to orders and logistics - dark-store routing, inventory-sync failure modes - at a fresher depth rather than production-scale detail.
How should I prepare for Blinkit interviews?
Practice DSA patterns around heaps, BFS/grid traversal, and interval problems, since these show up repeatedly in both the OA and technical rounds. For domain questions, be ready to explain inventory sync or the 10-minute delivery SLA in plain language - inputs, outputs, what breaks at scale - rather than buzzwords. Prepare a detailed project story and concrete answers on handling ambiguity, since Blinkit’s fast-moving product cycle makes that a recurring HR theme.
Is Blinkit’s tech hiring affected by its acquisition by Zomato?
Blinkit was acquired by Zomato in 2022 and now operates as part of the Eternal (formerly Zomato) group alongside Zomato’s food-delivery business. This mainly affects backend platform-sharing and cross-team integration rather than the fresher interview format itself, which stays focused on DSA, system design, and Blinkit’s own quick-commerce domain (dark stores, delivery SLAs) rather than food-delivery specifics.