Interview experience
Blinkit interview experiences covering Online Assessment, Technical Round 1, Technical Round 2, HR. Round-wise notes, common questions, and what candidates report clears each stage.
Blinkit Interview Questions and Answers (2026)
Blinkit is Eternal Limited's quick commerce brand delivering groceries in minutes across Indian cities, formerly known as Grofers. Engineering teams within Eternal's consumer tech stack build ordering, logistics, and fulfillment systems that power Blinkit and related products.
Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
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.
HR interview questions
Blinkit HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
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) |
| Managerial (some drives) | 45 min | Behavioural + technical mix |
| HR | 20-30 min | Motivation, relocation, final fit |
Blinkit online assessment: quick answers
These answers are compiled from public candidate reports and prep guides, not from an official Blinkit or Eternal notice, and drives differ. The instruction screen of your own test is the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | 90 minutes. A 2024 Zomato x Blinkit campus drive had 20 MCQs on OS, networks, DSA, OOP and DBMS plus 3 coding questions on graphs, DP and strings; other drives have 2-3 coding problems only. Older off-campus SDE-1 reports describe a 120-minute take-home assignment. |
| Does it have negative marking? | No public report mentions any, for the MCQs or the coding problems. |
| Is there a sectional cutoff? | Not reported. Candidates describe one combined shortlist across MCQs and coding. |
| How much is the cutoff? | Not published, and the filter is steep: 18 of 220 candidates cleared the OA in the 2024 campus drive. Candidate-reported eligibility is 7.0+ CGPA or 70% with no active backlogs; a 2020 referral intern report cites 6+ CGPA. |
| Which platform is it on? | HackerRank. |
| What topics come up? | Graphs, DP and strings in the OA; Maximal Square in the first interview; top-K, grid BFS and interval merging in other reports. |
| How many rounds after the OA? | Usually two technical rounds and HR. In the 2024 campus drive, 8 candidates cleared round 1, 3 cleared round 2, and all 3 got offers after HR. |
Blinkit interview questions by role
These topics come from GfG, Code360 and Glassdoor interview reports and Dataford’s Blinkit analyst guides. They show the level and style, not a fixed list.
| Role | Reported questions and topics |
|---|---|
| SDE-1 (campus) | Round 1: resume projects, RAG pipelines and neural-network basics when ML is on the resume, Docker, Kubernetes, Redis scaling, load balancing, consistent hashing, DNS, TCP vs UDP, and Maximal Square on paper. Round 2: Golang request handling with goroutines, channels and timeouts, and a rate limiter design. HR: why Zomato and your weaknesses. |
| SDE-1 (off-campus / lateral) | A 120-minute assignment, a traffic-light coding problem and a system design question (2021); rate limiters, ticket booking with seat locking, and Kafka vs RabbitMQ in lateral reports. |
| Business / data analyst | A SQL-heavy round on data structuring and product metrics; a moderate SQL test with a cross join and writing an inner join using a left join; order of execution; guesstimates such as traffic lights in your city; puzzles; a hiring-manager round on operational problem-solving. |
| Operations (dark store) | Store operations, last-mile and inventory questions, handling a difficult customer, and SLA and target handling. |
Asked across every role: why Blinkit or Zomato, a project you can defend in depth, and how you handle priorities that change overnight.
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. Some Zomato x Blinkit campus reports add ~20 CS MCQs (OS, CN, DSA, DBMS, OOP) before three coding problems on HackerRank - confirm your invite.
Common questions
- Top-K frequent elements (heap or bucket sort)
- Shortest path in a grid (BFS)
- Merge overlapping delivery slots (interval merge)
- Maximal Square or grid DP variants (campus tech-1 reports)
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
System-design focused, scoped to Blinkit’s actual product - order flows, dark-store routing, and inventory-sync challenges rather than a generic prompt. Lateral SDE-1 reports also include rate limiter design (token bucket / sliding window, Redis INCR+EXPIRE), ticket booking / seat locking, and Kafka vs RabbitMQ depth when messaging appears on your resume.
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
- Design a rate limiter - where it lives (edge vs service), storage, and algorithm choice
Round-by-round narratives are on the Blinkit interview experience page.
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.
Blinkit vs Zomato: which team is hiring you?
Blinkit and Zomato are both businesses of Eternal Ltd, and campus drives are often run jointly as “Zomato x Blinkit”. In the 2024 joint drive, the HR round still asked “Why do you want to join Zomato?”, so be ready to speak to both brands.
The OA and DSA rounds are shared. The difference is the domain in design rounds and in the work: Blinkit is quick commerce (dark-store inventory, 10-minute delivery SLAs, catalogue), while Zomato is food delivery (restaurant search, order tracking, delivery ETAs). This page covers Blinkit roles; read your offer letter for the hiring entity, since pay and location can differ.
Common question clusters (with frameworks)
Competitor write-ups mix SDE DSA loops with dark-store ops interviews. For engineering campus/off-campus, use these clusters.
1. Medium DSA with logistics flavour
Framework: Arrays, hashing, graphs, prefix sums. After AC, narrate how the same pattern appears in inventory or routing (without forcing a fake product story).
2. Ten-minute delivery system sketches
Framework: Clarify SLA, dark-store inventory, assignment of riders, failure (stock-out, delay). Draw APIs and one consistency trade-off. Freshers who only recite Twitter design lose points.
3. Frontend or machine-coding track (when invited)
Framework: JS event loop, React state, then ship a small UI under time. Scope-cut early; polish later.
4. Pace and ownership behaviour
Framework: STAR on shipping under time pressure, stakeholder conflict, and Why Blinkit or Eternal quick-commerce scale. Avoid BPO-only angry-customer scripts unless that is your role.
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.
Q: How would you design a rate limiter for an API?
Clarify scope first: per user, per IP, or per API key, and whether limits are global or per endpoint. A common pattern is a token bucket or sliding window backed by Redis - INCR a key with EXPIRE for fixed windows, or store timestamps in a sorted set for sliding accuracy. Place the limiter at the API gateway when protecting many services, or inside the service when rules are domain-specific. Return HTTP 429 with Retry-After, log rejections for abuse detection, and mention burst allowance so legitimate checkout spikes are not blocked. Public Blinkit SDE-1 reports explicitly probed rate-limiter placement and Redis usage.
Q: Delete a linked-list node when you only have a pointer to that node (no head)?
Copy the next node’s value into the current node, then bypass the next node by pointing current.next to next.next - O(1) time if deletion of the tail is not required (tail needs traversal from head). Interviewers use this to test pointer manipulation and edge-case honesty. A 2026 SDE-1 write-up described this as an opening “brain teaser” before database indexing discussion.
Q: House Robber with follow-ups - how do you approach variants?
Base problem: DP with rob(i) = max(rob(i-1), nums[i] + rob(i-2)). Follow-ups from Blinkit backend reports include circular street (run linear DP twice excluding first or last house), and signed weights (still DP but track max including negative gains carefully). State the recurrence aloud, handle empty/single-element arrays, then adapt constraints one at a time - panels often stack three follow-ups on one narrative problem.
Q: When would you choose SQL vs NoSQL for a tracking feature?
Start from access patterns: relational queries, joins, and strong consistency favour SQL; schema flexibility and horizontal document scaling favour document stores. A rejected SDE-1 backend report highlighted a trap: the interviewer wanted a file-system-based tracker for a single-user scenario - jumping to familiar databases without clarifying requirements wasted time. Always restate scale, query shape, and durability before naming technology.
Q: Explain database indexing like you would in an interview.
An index is a separate structure (often B-tree) mapping indexed column values to row locations, speeding SELECT/WHERE/JOIN at the cost of extra storage and slower INSERT/UPDATE because the index must update too. Mention composite indexes and left-prefix rules; avoid indexing every column. Tie to Blinkit contexts like looking up orders by user_id or SKU - candidate reports moved from puzzles to indexing after resume discussion.
Frequently asked questions about Blinkit interviews
Does the Blinkit online assessment have negative marking?
No public report mentions negative marking. The Blinkit SDE OA is a 90-minute HackerRank test - 2-3 coding problems, and on some Zomato x Blinkit campus drives about 20 core-CS MCQs as well - and no candidate report describes deductions for wrong answers.
How many students clear the Blinkit online assessment?
Very few; there is no published cutoff, and shortlists are relative to the batch. In a 2024 Zomato x Blinkit campus drive, 18 of 220 candidates cleared the OA, 8 cleared the first interview, and 3 received offers. Candidate-reported eligibility is 7.0+ CGPA or 70% with no active backlogs.
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?
Only slightly - 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.
Does Blinkit ask system design for freshers?
Often, yes - many SDE loops include a design or logistics sketch (orders, inventory, tracking) even for early-career candidates. Keep it structured: requirements, APIs, data, failure modes. You are not expected to design Blinkit’s full production stack.
Is Blinkit hiring under Zomato or Eternal branding?
It can be any of the three - offer letters and career pages may say Blinkit, Zomato, or Eternal depending on the entity. Read the JD and letter carefully; prep for quick-commerce engineering either way.
How to prepare for Blinkit interviews
- Loop map: Online Assessment; Technical Round 1; Technical Round 2; HR. Confirm timings from the drive mail.
- Technical depth: Drill the Q&A section until answers are spoken, not read. Know every resume project cold.
- Experiences: Study round-wise notes on the interview experience page - real prompts beat generic lists.
- HR: Three STAR stories + a specific “Why Blinkit?” on the HR page.
A practical Blinkit prep plan
Use this as a default four-week loop before a Blinkit drive. Adjust to your invite timeline.
- Week 1: Oa pattern first: sit one untimed paper, then redo it under the real clock. Open the Blinkit previous-year sets on this site and mark which sections ate your time. Write the timing on a sticky note. That number is more useful than a 200-problem LeetCode streak you never timed.
- Week 2: Most Blinkit drives fail people on the first timed paper or OA. Do three timed sits this week. After each one, log every miss in a two-column note: topic and why (slow, wrong formula, bad edge case, panic). The next sit should only add problems from that log.
- Week 3: Technical interviews at Blinkit usually want a clean project story, one or two CS fundamentals, and (if the process has it) a behavioral or values round. Write STAR stories on paper, not in your head. Practise “Why Blinkit?” with one concrete product, lab, or business line - not a slogan.
- Week 4: Star stories + one project walkthrough recorded on your phone. If you still have energy, redo only the questions you failed in week 2.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Compensation notes
Candidate-reported fresher/early-career packages for Blinkit often cite SDE ₹18-25 LPA. Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.
Sources
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the Blinkit interview experience page. For OA papers and coding drills, use Blinkit on placementpapers.app. OA quick answers and role-wise questions draw on GfG’s Zomato x Blinkit SDE-1 on-campus 2024 interview experience, Code360 Blinkit (Grofers) interview experiences, Glassdoor Blinkit analytics interview reviews and Dataford’s Blinkit data analyst guide.