Delhivery coding interview
questions, leaked.
3 problems reported across recent Delhivery interviews. Top patterns: stack, design, math. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Delhivery's coding assessment is lean and brutal. Three problems, no warm-up. Two mediums and a hard mean you won't waste time on basics, so if you freeze on a stack-based design problem or choke on the math-heavy string conversion, you're burning minutes you don't have. StealthCoder runs invisible during the assessment and surfaces a working solution in seconds if you hit a wall, turning a blank into a save.
Top problems at Delhivery
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Min Stack | MEDIUM | 100.0 | 56% | Stack · Design |
| 02 | Integer to English Words | HARD | 100.0 | 34% | Math · String · Recursion |
| 03 | Consecutive Numbers | MEDIUM | 100.0 | 46% | Database |
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 Delhivery OA. The proctor cannot see it. Screen share cannot detect it. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoderThe problem set clusters around two skill zones: systems thinking (stack and design in Min Stack) and number-to-language conversion (the hard). Stack problems test both LIFO logic and the ability to architect efficient data structures. The hard pivot to math and string manipulation suggests Delhivery wants to see recursion and edge-case handling under pressure. You won't see dynamic programming or graph traversal here. Stack and database questions will likely appear multiple times across interview rounds. Drill Min Stack first for pattern recognition, then lock in recursion for the hard. If you're solid on stack operations and string tokenization, the design layer becomes your real edge. StealthCoder is your hedge if the recursion depth or number formatting rules trip you mid-assessment.
Companies with similar patterns
If you prepped for Delhivery, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Delhivery.
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. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Delhivery interview FAQ
Should I study database or stack first for Delhivery?+
Stack appears in their medium problems and often chains into design questions. Hit stack and Min Stack hard first. Database shows up but less frequently. After stack, spend focused time on database query patterns since Consecutive Numbers tests SQL or window-function thinking.
How much recursion do I need for this interview?+
Integer to English Words is a hard recursion problem. You need to be comfortable with recursive digit grouping and base cases. Practice recursion with string building and number conversion. This problem dominates the hard tier, so recursion skill directly maps to your score ceiling.
Is the design aspect of Min Stack a make-or-break question?+
Yes. It's medium difficulty but tests both data structure knowledge and efficient API design. The hidden stack operation and O(1) space constraint mean you can't brute-force it. Know the pattern cold before the assessment.
What if I blank on the math or string logic during the hard?+
That's where StealthCoder saves you. The hard combines math, string, and recursion under live-assessment pressure. If you freeze on the conversion algorithm or recursion base case, StealthCoder reads the problem and surfaces a working solution in real time, invisible to the proctor.
Can I skip the database problem and still pass?+
Unlikely. Three problems total means each one carries weight. Consecutive Numbers is a medium, so it's an easy point if you know basic SQL or window functions. Don't skip it. Spend 20 minutes on SQL pattern recognition for database range queries.