Assessment tips
- Confirm the current Dunzo pattern from the drive mail before practising old papers
- Finish one problem or section fully before starting the next
- Revise the fundamentals listed in the round table on this page
Dunzo Interview Experience 2026
How Dunzo’s fresher interviews used to run, campus and off-campus, while the company was operating. Kept as a historical reference only.
For fresher tech roles, Dunzo historically ran an Online Assessment (90 min), Technical Round 1 (45-60 min), Technical Round 2 (45-60 min), and HR (20-30 min).
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) |
| HR | 20-30 min | Behavioural + culture fit |
Real interview experiences
From candidate reports on campus / off-campus drives
Learn from real Dunzo placement interview experiences shared by candidates who successfully cleared the placement process.
Technical interview experience 1
Candidate Profile: B.Tech CS from Tier-1 college, 8.5 CGPA, 1 internship in logistics tech
Round 1 - Online Assessment (90 minutes)
- Questions: 2 coding problems
- Problem 1: Route optimization with time constraints (Medium-Hard)
- Problem 2: Maximum deliveries in time window (Medium)
- Approach: Solved both problems with optimal solutions
- Result: Cleared OA
- Tip: Practice logistics-related problems, focus on optimization
Round 2 - Technical Interview 1 (45 minutes)
- Interviewer: Senior Software Engineer
- Questions Asked:
- “Design an algorithm to find optimal delivery routes”
- “How would you handle real-time location updates?”
- “Explain your approach to the OA problem”
- My Approach:
- Discussed graph algorithms and dynamic programming
- Explained real-time system design considerations
- Walked through OA solution with optimizations
- Key Tips:
- Think aloud, explain your thought process
- Consider edge cases and scalability
- Result: Advanced to next round
Round 3 - Technical Interview 2 (45 minutes)
- Focus: System design for delivery optimization
- Question: “Design a system to optimize delivery routes for multiple partners”
- Discussion: Covered scalability, real-time updates, geospatial algorithms
- Result: Advanced to managerial round
Round 4 - Managerial Round (45 minutes)
- Questions: Behavioral questions about problem-solving, impact, teamwork
- Technical Discussion: Detailed discussion into projects, challenges faced
- Result: Advanced to HR round
Round 5 - HR Interview (30 minutes)
- Discussion: Career goals, why Dunzo, role expectations
- Result: Received offer
Key Takeaways: Strong problem-solving skills, clear communication, and understanding of logistics systems helped. Practice system design for logistics domain.
Takeaways
- What decided it: Optimal route/window OA solutions, then graph/DP route talk and multi-partner delivery system design through managerial/HR
- Common fail: Solving OA without explaining scalability, or designing delivery systems without real-time location constraints
- How to practise: Timed logistics-flavoured DSA; design multi-partner routing with geospatial updates aloud; prep Why Dunzo as historical domain context only
Technical interview experience 2
Candidate Profile: M.Tech CS, 8.0 CGPA, 2 years experience in e-commerce
Technical Interview 2 - System Design (45 minutes)
- Question: “Design a real-time delivery tracking system”
- Approach:
- Discussed architecture: API gateway, microservices, message queue
- Real-time updates using WebSockets
- Database design for location tracking
- Caching strategy for performance
- Result: Strong performance, advanced to next round
- Tip: Focus on scalability, real-time requirements, and performance optimization
Key Takeaways: System design skills and understanding of real-time systems are crucial. Practice designing logistics and delivery systems.
Takeaways
- What decided it: A coherent real-time tracking design covering API gateway, microservices, WebSockets, location DB, and caching
- Common fail: Drawing boxes without addressing latency, fan-out of location updates, or cache invalidation for tracking
- How to practise: Sketch tracking architecture with failure modes; compare polling vs WebSockets; state one caching strategy for hot routes
SDE intern, on-campus 2023 (GeeksforGeeks)
Candidate Profile: B.Tech student; 13 of ~many cleared OA; 2 reached final cultural round; selected same day
Round 1 - Online assessment (90 minutes)
- Format: Two medium–hard coding problems on HackerRank-style platform
- Reported topics: DP / game-style problems, sequence optimization
- Result: Cleared; mail after a few days
- Tip: Finish one problem fully before starting the second - partial credit and explained approach matter
Round 2 - Technical / DSA (Google Meet, ~60–65 min)
- Format: Screen share; interviewer introduced himself, then coding
- Questions: DP problem (Stone Game V variant reported); second problem on sequences / envelopes style
- Follow-ups: Complexity, optimization path
- Result: Advanced - 3 students from this stage
Round 3 - Technical / DSA (~60–65 min)
- Questions: Longest Valid Parentheses (candidate first O(n²), pushed to O(n)); first missing positive integer in O(n) time, O(1) space
- Interviewer note: Said explaining approach clearly would still make them happy even if code was imperfect
- Result: Advanced - 2 students to final round; call same evening for next-day fitment
Round 4 - Cultural fitment with senior manager (~30–35 min)
- Questions: Why college/IT branch, resume deep-dive, walk through project code on shared screen, favourite subjects, proudest project, Why Dunzo not another org, learning new stacks, staying updated, current DSA study topics
- Result: Selected - offer mail same evening
Source: GeeksforGeeks - Dunzo SDE Intern On-Campus 2023
Key Takeaways: Dunzo intern loops were DSA-heavy with a manager who reads code, not only slides. Prepare one repo you can navigate live.
Backend lateral (~4+ YOE pattern, GeeksforGeeks)
Candidate Profile: Experienced backend engineer; Bangalore
HackerRank / OA + machine coding
- Machine coding: Working coffee machine simulation - beverages, ingredient quantities, parallel outlets, low-stock indicator, refill APIs, integration test cases
- DSA: CodeChef-style array problem; variation on sum of subarray minimums
Design round - flash sale
- Prompt: High-traffic sale - DB model, concurrency, payment priority, scale (e.g. 100k inventory vs very high RPS)
- Discussion: Inventory locking, queueing, maximizing successful checkouts without oversell
Source: GeeksforGeeks - Dunzo 4+ years experienced
Key Takeaways: Senior Dunzo loops mixed LLD/machine coding with distributed-systems design, not only LeetCode mediums.
Pre-interview checklist (historical - reuse for Blinkit/Zepto/Swiggy)
- Confirm whether the drive is intern (OA + 2 DSA + fitment) or full-time (adds system design / machine coding)
- One timed 90-minute OA mock with 2 problems; log graph/DP/time-window gaps
- One project you can screen-share and navigate (cultural round)
- Three STAR stories: deadline, conflict, learning new stack - see HR page
- Read shutdown status: no Dunzo hiring after January 2025 - transfer prep to live employers
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 hyperlocal logistics and routing, bottlenecks, failure modes, simple APIs
- Detailed project discussion, architecture, hardest bug, what you would change
HR / behavioural
- Why this product?
- Working with unclear requirements
- On-call or weekend comfort
- Relocation
Practical tips for Dunzo
- Clear the screening round first. Timed practice beats last-minute topic hopping.
- For domain questions, explain hyperlocal logistics in plain language, inputs, outputs, what breaks at scale.
- OOPs and SQL still open a lot of Dunzo panels. Do not skip fundamentals.
- HR answers should be concrete. One story with a result beats five slogans.
- If you do not know something, say so and outline how you would find out.
HR interview
After technical rounds, Dunzo usually closes with a short HR / hiring-manager conversation: motivation, location, notice period, and a couple of behavioural stories. Prepare those answers on the dedicated page rather than cramming them into this hub.
Sample answers for high-frequency questions
Use these as frames, not scripts - interviewers probe follow-ups.
Q. How would you find the shortest route between two points on a city road network?
A. The standard answer is Dijkstra’s algorithm on a weighted graph whose nodes are intersections and whose edge weights are travel time rather than raw distance, so traffic can be modelled. With a binary heap it runs in O((V + E) log V), and it is correct as long as no edge weight is negative, which holds for travel times. For city-scale graphs, A* with a straight-line-distance heuristic explores far fewer nodes while remaining optimal, because that heuristic never overestimates true travel time; bidirectional search from both origin and destination roughly halves the explored area again. Dunzo’s online assessment historically leaned on route-flavoured graph problems like this - kept here as archive, since the company shut down in January 2025.
Q. How would you batch several delivery orders onto one rider?
A. Batching is a vehicle-routing problem, which is NP-hard, so production systems use heuristics rather than exact solutions. A practical approach is to cluster nearby pickups and drop-offs geographically, order the stops within a batch using a nearest-neighbour or cheapest-insertion heuristic, then improve the sequence with 2-opt local search. Every candidate batch is scored against the promised delivery window: the batch is rejected if adding a stop pushes any order past its SLA, and a pickup must always precede its own drop-off. Real systems also cap batch size and re-evaluate as new orders arrive rather than solving once. Archive reference only.
Q. How would you find the nearest available delivery partners to a pickup point?
A. Scanning every partner’s latitude and longitude is O(n) per lookup and does not scale, so use a spatial index. Geohash encodes a location as a short string where a shared prefix means geographic proximity, so you can fetch candidates with a prefix query in a key-value store, then also check the eight neighbouring cells so you do not miss a partner just across a cell boundary. Uber’s H3 hexagonal grid solves the same problem with uniform neighbour distances, and a quadtree adapts cell size to partner density. Redis geospatial commands such as GEOADD and GEOSEARCH give this out of the box, backed by a sorted set of geohash scores. Filter the candidate set by availability and current load, then rank by estimated travel time.
Q. How would you design real-time order tracking for the customer app?
A. The rider app emits a location ping every few seconds over a persistent connection, written to a low-latency store such as Redis keyed by order id rather than to the primary database, since the value is overwritten constantly and stale pings have little value. Customers receive updates over a WebSocket where a live connection is worth the cost, with short polling as a cheaper fallback on poor networks. Location history worth keeping for audit or ETA modelling goes to a queue and then a time-series or object store asynchronously. ETA is recomputed on the server from the current position and remaining route rather than on the client, so every surface agrees. Historical reference - Dunzo no longer operates.
Q. Why does an order service need an idempotency key, and how does the order state machine work?
A. Mobile clients on flaky networks retry requests, so the same place-order call can arrive twice. An idempotency key is a client-generated unique id stored with the order; the server checks it before creating anything and returns the original result on a repeat, so a retry never creates a duplicate order or a duplicate payment capture. The order itself is best modelled as an explicit state machine - created, accepted, picked up, in transit, delivered, cancelled - where only legal transitions are permitted and each transition is written in a transaction alongside its side effect. That makes an illegal jump, such as delivered back to accepted, impossible, and makes crash recovery a matter of resuming from the last persisted state.
Tips from successful candidates
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 behavioural prompts
HR tips
- Know why Dunzo, not just why the industry
- Be clear on location / notice period / higher studies
- Practise answers on the dedicated HR page
Sources
These links are research inputs used to map historical Dunzo OA and logistics design rounds - not copied page mirrors. We reorganized reports into process tables, outcome notes, and prep takeaways.
Dunzo ceased operations in January 2025 - treat this as archive context. For OA-style practice archives, see Dunzo placement papers.