Swiggy hub
Swiggy Online Assessment
Overview
Swiggy online assessment (OA) is the first hard filter for most fresher, campus, and off-campus SDE-style drives. This page covers the Swiggy OA format, what happens after you clear it, sample Swiggy OA questions with approaches, an 8-week prep plan, and mistakes that sink otherwise-strong candidates.
Patterns below are from student reports for 2025-2026. Platforms and section names can change by drive. Always confirm the college placement email for your window.
Swiggy hiring flow after the OA
| Stage | What candidates report | What you must show |
|---|---|---|
| 1. Online assessment | Usually timed DSA OA (about 90-120 min, 2-3 problems) on HackerRank-style platforms | Correctness + reasonable complexity under time |
| 2. Technical interviews | DSA + projects; marketplace/delivery product sense in some rounds | Explain approach, edge cases, complexity |
| 3. Later rounds | Hiring manager; HR for role/location/CTC | Depth beyond the OA pattern |
| 4. HR / offer | Role, location, CTC discussion | Consistency with resume |
Swiggy Online Assessment format
Test structure
| Component | From student reports details |
|---|---|
| Platform | HackerRank or similar |
| Duration | About 90-120 minutes (confirm invite) |
| Question mix | 2-3 DSA problems; occasional MCQ tech mix |
| Languages | Java, C++, Python |
| Scoring | Automated tests; aim for full green |
| Advance rate | Competitive product-company filter; treat as medium-hard bar |
What makes Swiggy OA feel distinct
- Problems often map to delivery, ETA, assignment, and geo/grid intuition
- Still standard DSA under the hood (graphs, heaps, greedy)
- Speed + correctness both matter; unfinished second problem is common failure mode
- Culture/product rounds come after OA, not instead of it
Question types you should expect
Core DSA
- Heaps (assign nearest partner, top-k)
- Graphs / BFS on grids (reachability, zones)
- Greedy interval and scheduling
- Hashing and sliding window on event streams
- DP for path/assignment variants
Secondary / role-dependent
- Light OOPs/DB MCQs in some campus papers
- Debugging assignment logic
What usually does not appear in the OA
- Full fleet routing MILP (interviews may discuss trade-offs instead)
- Long aptitude-only papers
- Designer take-home UI tasks for SWE OA
Sample Swiggy Online Assessment questions
Question 1: assign nearest delivery partner
Q: For each order location, pick the closest available partner (Manhattan distance).
Brute force is fine for small n. For larger n, spatial indexing ideas or sorting tricks may appear in interviews; OA often accepts careful O(n*m).
Question 2: maximum orders in a time window
Q: Given order timestamps, max orders inside any window of length T.
Sort + sliding window / two pointers. O(n log n).
Question 3: zone connectivity
Q: Grid cells open/blocked. Can a rider reach the customer?
BFS/DFS from start. Mark visited. Classic grid graph.
Question 4: surge batching
Q: Batch orders that start within K minutes; maximize batches under capacity C.
Sort by time, greedy pack while capacity remains. Clarify whether batches must be contiguous.
Question 5: priority queue of eta updates
Q: Maintain the current soonest ETA among active orders as updates arrive.
Min-heap keyed by ETA; handle lazy deletions when orders cancel.
Question 6: interval overlap of partner shifts
Q: Count maximum partners on shift at once given [start,end] intervals.
Sweep line: +1 at start, -1 at end, sort events. O(n log n).
How to prepare for Swiggy OA (8-week plan)
| Weeks | Focus | Exit criteria |
|---|---|---|
| 1-2 | Arrays, hashing, two pointers, sliding window | 40+ easy/medium solved cleanly |
| 3-4 | Trees, graphs (BFS/DFS), heaps | Can code BFS/DFS without notes |
| 5-6 | DP + greedy patterns (heap + greedy scheduling drills) | 25+ medium DP/greedy with recursion to bottom-up |
| 7 | Timed full mocks matching About 90-120 minutes (confirm invite) | Finish 2 solid greens with complexity notes with passing tests |
| 8 | Weak-topic repair + complexity review | Re-solve every miss within 48 hours |
Daily loop
- One timed medium problem (45-60 min hard cap)
- Write complexity and 3 edge cases before coding
- If stuck past 20 minutes, peek pattern name only, then re-solve tomorrow cold
- Log misses by topic on a simple sheet
Company pages on this site
- Swiggy coding questions
- Swiggy aptitude / mock quiz
- Swiggy interview experience
- Swiggy preparation guide
- Practice PDF: Swiggy Placement Papers PDF (2026)
Common mistakes on Swiggy OA
- Modeling delivery problems as pure math without mapping to known DSA
- Wrong distance metric (forget constraints say Manhattan vs Euclidean)
- Priority queue comparator bugs in Java/C++
- No time left for the second coding problem
- Cannot explain your OA solution in the interview debrief
Day-of checklist
- Stable internet, charged laptop, quiet room
- Confirm language template compiles on the platform before starting hard problems
- Skim all problems for 3-4 minutes, order by familiarity
- Submit a correct brute force early if constraints allow, then optimize
- Leave 8-10 minutes for edge-case tests you invent yourself