Blinkit’s fresher SDE interview process is a 90-minute online assessment of two or three coding problems, a technical round on DSA and your projects, a second technical round on system design for orders and logistics, a managerial round on some drives, and a 20-30 minute HR round on motivation, relocation and weaknesses. Modified DSA problems and the orders and logistics design round decide more outcomes than trivia.
Blinkit placement process includes: 1. Online Assessment (OA) (90 minutes) - 2-3 medium coding problems, 2. Technical Interview Round 1 (45 minutes) - Data structures and algorithms, 3. Technical Interview Round 2 (45 minutes) - System design and detailed technical discussion, 4. Managerial Round (45 minutes) - Behavioral and technical discussion, 5. HR Round (30 minutes) - Final discussion. Total duration: 2-3 weeks from application to offer.
Round-wise process
| 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 | Mixed behavioral + technical |
| HR / culture fit | 20-30 min | Motivation, relocation, weaknesses |
Real interview experiences
Documented on-campus drive: Zomato x Blinkit, SDE-I (2024)
Source: GeeksforGeeks, on-campus 2024
Blinkit hires on campus jointly with Zomato, and this write-up is the most useful fresher-facing account available because the candidate recorded the funnel at every stage.
Online assessment (90 minutes, HackerRank)
- 20 MCQs on core CS subjects (OS, computer networks, DSA, OOP, DBMS) plus 3 coding problems on graphs, dynamic programming and strings.
- 18 candidates advanced out of 220.
Round 1 - technical interview
- Project discussion, then a wide sweep: machine learning concepts (RAG pipelines, neural networks, Word2Vec), DevOps (Docker, Kubernetes, Redis), system design (load balancing, consistent hashing), and networking (DNS, TCP vs UDP).
- One DSA problem: Maximal Square.
- The candidate credited using diagrams and sketches to explain answers.
- 8 candidates advanced.
Round 2 - advanced technical interview
- Implementing request logic in Go with goroutines and channels, plus timeout handling.
- A system design task: design a rate limiter, with the interviewer pushing on practical implementation and edge cases.
- 3 candidates advanced.
Round 3 - HR
- Why Zomato, and weaknesses. All three finalists received offers.
Worth noting: this candidate’s profile was projects-heavy (60+ GitHub repositories, a personal DSA log), and Round 1 ranged far outside DSA - ML, DevOps, and networking all came up because they were on the resume.
Documented experienced/referral track: SDE-1 Backend - rejected at system design
Source: GeeksforGeeks
A candidate with a six-month internship and some work experience got a referral after messaging a Blinkit employee. The process had three rounds, and the candidate was cut at the second:
Technical Round 1 (60 minutes) - cleared
- Five tweaked standard problems: House Robber, its circular version, and a version with positive and negative weights (three follow-ups), then a story problem that reduced to topological sort plus a graph coloring check.
- Also asked why SQL over NoSQL, and why Grafana is used.
Technical Round 2 (system design) - the elimination
- Asked to design a tracking system for a single user. The interviewer was looking for a file-system-based solution, not a database; the candidate lost significant time working through SQL, NoSQL, and in-memory options.
- Also: debugging Python code, a prefix-string counting problem using tries (where the interviewer indicated a better solution existed), and questions on indexing and sharding, which the candidate estimated they answered 60-70% correctly.
Outcome: rejected, with the gap identified as trade-off reasoning in system design rather than raw problem-solving. Their own stated lessons were to think beyond the tools you already reach for, to understand what the problem actually requires before choosing a solution, and to keep communication clear throughout.
Takeaway: Blinkit’s coding rounds lean on modified standard problems - expect house-robber and grid-DP style questions with constraints bolted on rather than clean LeetCode restatements. Core CS subjects (OS and networking especially) are tested in the OA and again in interviews. And the round that most often ends candidacies is system design, where naming a familiar database is worse than reasoning out loud about what the requirements actually demand.
SDE-1 - 35-minute technical (Medium, February 2026)
SDE-1 - 35-minute technical
Source: Medium, Ketan Raj, February 2026
Candidate profile: SDE-1 candidate with MongoDB and cloud database experience mostly from personal projects; a 60-minute slot that ended in 35
Questions
- Jump Game: brute-force recursion, then memoization, then a greedy max-reach pass in O(n) time and O(1) space
- Delete a node in a singly linked list without the head pointer (copy the next node’s value, skip it), and why it fails for the last node
- Database experience and how indexing works: faster SELECT, slower INSERT
- The candidate asked about work culture and how the team uses AI day to day
- Result: Waiting to hear about the next round at the time of writing
Takeaways
- What it shows: Interviewers push for progressive optimization; starting with brute force is fine if you improve it out loud
SDE-1 Eternal, Gurgaon - offer (LeetCode Discuss, June 2026)
SDE-1 Gurgaon - offer
Source: LeetCode Discuss, June 2026
Candidate profile: B.Tech from a tier-1 college; about one year at a large MNC; offer reported
Round 1 - problem solving (SDE-III interviewer)
- Introductions; why leave the current company
- House Robber and House Robber II
- SQL vs NoSQL and Redis, such as what happens if you use only Redis and no database
Round 2 - DSA, then BookMyShow-style design
- DSA: given two arrays of unique numbers, does a unique-number array exist that contains both as subsequences?
- Ticket booking design, short on time: UX for a high-traffic event, two users picking the same seat at once, pessimistic vs optimistic locking, Redis
Round 3 - culture fit with a Tech Lead (about 30 min)
- Two business problems talked through aloud, with clarifying questions
- Relocation and team preference
- Result: Offer by phone the next day; about 10 days from recruiter call to offer
Key takeaways: Even “culture” rounds may throw live business problems; ask clarifying questions out loud.
Sources:
- Zomato x Blinkit Interview Experience for SDE-I, On-Campus 2024 - GeeksforGeeks (student write-up, offer)
- Blinkit Interview Experience for SDE-1 Backend - GeeksforGeeks (candidate write-up, rejected)
- Blinkit Interview Experience for SDE-1 - GeeksforGeeks (candidate write-up)
- Blinkit Interview Experience for SDE Internship - GeeksforGeeks (student write-up)
- Interview Experience | Blinkit (Eternal) | SDE-1 | Gurgaon | June 2026 - LeetCode Discuss (candidate write-up, offer reported)
- 35 Minutes to Success: SDE-1 Interview Experience at Blinkit - Medium (candidate write-up)
Questions that come up often
Coding / technical
- Top-K frequent elements. Usually expects heap / bucket sort
- Shortest path in a grid. Usually expects BFS
- Merge overlapping delivery slots. Usually expects interval merge
- Discussion on inventory sync and 10-minute delivery SLA, bottlenecks, failure modes, simple APIs
- Detailed project discussion, architecture, hardest bug, what you would change
HR / behavioral
- Why this product?
- Working with unclear requirements
- On-call or weekend comfort
- Relocation
Practical tips for Blinkit
- Clear the screening round first. Timed practice beats last-minute topic hopping.
- For domain questions, explain inventory sync in plain language, inputs, outputs, what breaks at scale.
- OOPs and SQL still open a lot of Blinkit panels. Do not skip fundamentals.
- HR answers should be concrete. One story with a result beats five slogans.
HR interview
After technical rounds, Blinkit usually closes with a short HR / hiring-manager conversation: motivation, location, notice period, and a couple of behavioral stories.
Sample answers for high-frequency questions
Q. How do you find the top K frequent elements in an array?
A. 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 optimization.
Q. How do you find the shortest path in a grid with obstacles?
A. 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?
A. 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?
A. 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?
A. 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.
Tips from successful candidates
Assessment tips
- Confirm the current Blinkit pattern from the drive mail before practicing old papers
- Finish one problem or section fully before starting the next
- Revise the fundamentals listed in the round table on this page
Interview tips
- Narrate trade-offs; expect “why” after every answer
- Only list projects you can defend under follow-ups
- Prepare 3-4 STAR stories for behavioral prompts
HR tips
- Know why Blinkit, not just why the industry
- Be clear on location / notice period / higher studies
- Practice answers on the dedicated HR page
Sources
The candidate reports behind this page are linked under Real interview experiences above. Cross-check the current drive mail for timings. For OA practice, see Blinkit placement papers.