Swiggy coding interview
questions, leaked.
31 problems reported across recent Swiggy interviews. Top patterns: array, hash table, sorting. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Swiggy's coding assessment leans hard on arrays and hash tables, with 21 and 11 problems respectively across a pool of 31. Most questions sit in the medium band (18 problems), so you're not facing a gauntlet of easy warm-ups before the real test. You'll see sorting, two-pointers, and stack patterns woven through nearly every major problem type. If you blank on a hash-table or array problem mid-assessment, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds, letting you move past the wall and rack up points on the rest of the loop.
Top problems at Swiggy
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Maximize Area of Square Hole in Grid | MEDIUM | 100.0 | 37% | Array · Sorting |
| 02 | Minimum Value to Get Positive Step by Step Sum | EASY | 97.6 | 65% | Array · Prefix Sum |
| 03 | Sort Colors | MEDIUM | 80.5 | 68% | Array · Two Pointers · Sorting |
| 04 | Happy Number | EASY | 75.0 | 58% | Hash Table · Math · Two Pointers |
| 05 | Next Greater Element I | EASY | 75.0 | 75% | Array · Hash Table · Stack |
| 06 | Merge Sorted Array | EASY | 75.0 | 53% | Array · Two Pointers · Sorting |
| 07 | Valid Parentheses | EASY | 75.0 | 42% | String · Stack |
| 08 | Maximum Profit in Job Scheduling | HARD | 75.0 | 54% | Array · Binary Search · Dynamic Programming |
| 09 | Integer to Roman | MEDIUM | 67.9 | 69% | Hash Table · Math · String |
| 10 | Count Good Meals | MEDIUM | 67.9 | 32% | Array · Hash Table |
| 11 | Fair Candy Swap | EASY | 67.9 | 63% | Array · Hash Table · Binary Search |
| 12 | Course Schedule | MEDIUM | 67.9 | 49% | Depth-First Search · Breadth-First Search · Graph |
| 13 | Daily Temperatures | MEDIUM | 67.9 | 67% | Array · Stack · Monotonic Stack |
| 14 | Two City Scheduling | MEDIUM | 58.0 | 68% | Array · Greedy · Sorting |
| 15 | Edit Distance | MEDIUM | 58.0 | 59% | String · Dynamic Programming |
| 16 | Minimum Number of Work Sessions to Finish the Tasks | MEDIUM | 58.0 | 34% | Array · Dynamic Programming · Backtracking |
| 17 | Subsets II | MEDIUM | 58.0 | 60% | Array · Backtracking · Bit Manipulation |
| 18 | Maximum Length of Pair Chain | MEDIUM | 58.0 | 61% | Array · Dynamic Programming · Greedy |
| 19 | Majority Element | EASY | 58.0 | 66% | Array · Hash Table · Divide and Conquer |
| 20 | Merge Two Sorted Lists | EASY | 58.0 | 67% | Linked List · Recursion |
| 21 | Longest Consecutive Sequence | MEDIUM | 58.0 | 47% | Array · Hash Table · Union Find |
| 22 | LRU Cache | MEDIUM | 58.0 | 45% | Hash Table · Linked List · Design |
| 23 | First Missing Positive | HARD | 58.0 | 41% | Array · Hash Table |
| 24 | Median of Two Sorted Arrays | HARD | 58.0 | 44% | Array · Binary Search · Divide and Conquer |
| 25 | Subarray Sum Equals K | MEDIUM | 58.0 | 45% | Array · Hash Table · Prefix Sum |
| 26 | Maximum Score From Removing Substrings | MEDIUM | 58.0 | 63% | String · Stack · Greedy |
| 27 | Immediate Food Delivery II | MEDIUM | 58.0 | 54% | Database |
| 28 | Letter Combinations of a Phone Number | MEDIUM | 58.0 | 64% | Hash Table · String · Backtracking |
| 29 | K Closest Points to Origin | MEDIUM | 58.0 | 68% | Array · Math · Divide and Conquer |
| 30 | Best Time to Buy and Sell Stock | EASY | 58.0 | 55% | Array · Dynamic Programming |
| 31 | Trapping Rain Water | HARD | 58.0 | 65% | Array · Two Pointers · Dynamic Programming |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Swiggy OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array21 · 68%
- hash table11 · 35%
- sorting9 · 29%
- dynamic programming6 · 19%
- string5 · 16%
- stack5 · 16%
- two pointers4 · 13%
- greedy3 · 10%
- math3 · 10%
- monotonic stack3 · 10%
Array problems dominate the interview, appearing in 21 of 31 reported questions. Hash tables are the second pillar, paired with arrays in counting and lookup tasks like Count Good Meals and Fair Candy Swap. Sorting surfaces constantly, either standalone or mixed into array problems like Sort Colors and Maximize Area of Square Hole in Grid. Stack and monotonic-stack patterns show up in roughly one in four problems (Next Greater Element I, Daily Temperatures, Valid Parentheses). Dynamic programming and binary search are lower-frequency but appear in the hard tier (Maximum Profit in Job Scheduling, Edit Distance). The medium-difficulty skew means you need fast pattern recognition, not just brute-force ability. StealthCoder is your hedge for the patterns you didn't have time to drill. Greedy and two-pointers round out the tail, so don't skip them, but array and hash-table fluency will carry you through most of the OA.
Companies with similar patterns
If you prepped for Swiggy, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Swiggy.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Swiggy interview FAQ
How many array problems should I drill before the Swiggy assessment?+
Array problems make up 21 of 31 reported questions, so drilling 15 to 20 focused array problems is solid baseline coverage. Mix in problems like Merge Sorted Array and Sort Colors to get comfortable with two-pointers and in-place manipulation. The remaining time goes to hash tables and stack patterns.
Are hash tables really that important for this interview?+
Yes. Hash tables appear in 11 of 31 problems and are almost always paired with arrays or strings. Count Good Meals and Fair Candy Swap are common patterns here. If you can't think through hash-table space-time tradeoffs in real time, you'll lose points on medium problems.
What should I study first if I have one week?+
Arrays and hash tables first, three to four days combined. Then stack and monotonic-stack patterns (Next Greater Element I, Daily Temperatures), which appear in roughly one in four problems. Sorting and two-pointers are often baked into array problems, so you'll practice them naturally.
Is dynamic programming a blocker for Swiggy?+
Not heavily. DP appears in 6 problems out of 31, mostly in the hard tier (Maximum Profit in Job Scheduling, Edit Distance). If you've drilled arrays and hash tables, you can skip deep DP prep and use that time for stack and sorting patterns instead.
How should I handle the medium-difficulty skew in the assessment?+
18 of 31 problems are medium, so expect to be uncomfortable. Focus on problems like Sort Colors and Daily Temperatures that mix two or three patterns together. Practice your pattern recognition under time pressure, not just correctness. That's where most candidates stumble.