Darwinbox coding interview
questions, leaked.
5 problems reported across recent Darwinbox interviews. Top patterns: array, dynamic programming, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Darwinbox's coding assessment is lean but punishing. Five problems, mostly medium and hard difficulty, no warm-ups. Arrays dominate the signal they're testing for, appearing in four of five problems. Dynamic programming shows up twice at hard difficulty, which means you need to recognize DP state transitions under pressure. The assessment is compact enough that you can't hide weak spots. If you blank on a two-pointer or DP subproblem mid-OA, StealthCoder runs invisible during screen share and surfaces a working solution in seconds, buying you time to move forward.
Top problems at Darwinbox
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Scramble String | HARD | 100.0 | 42% | String · Dynamic Programming |
| 02 | Spiral Matrix | MEDIUM | 71.5 | 54% | Array · Matrix · Simulation |
| 03 | Minimum Size Subarray Sum | MEDIUM | 58.4 | 49% | Array · Binary Search · Sliding Window |
| 04 | Majority Element II | MEDIUM | 58.4 | 54% | Array · Hash Table · Sorting |
| 05 | Number of Great Partitions | HARD | 58.4 | 32% | Array · 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 Darwinbox 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- array4 · 80%
- dynamic programming2 · 40%
- string1 · 20%
- matrix1 · 20%
- simulation1 · 20%
- binary search1 · 20%
- sliding window1 · 20%
- prefix sum1 · 20%
- hash table1 · 20%
- sorting1 · 20%
The distribution tells you exactly what to drill first. Array problems anchor 80 percent of the assessment, so your foundation has to be solid on subarrays, sliding windows, and prefix sums. Spiral Matrix tests spatial reasoning under time pressure. Minimum Size Subarray Sum combines binary search with sliding window, a pattern that looks easy until you're live and your brain locks. The two hard problems, Scramble String and Number of Great Partitions, both lean on dynamic programming. That's the spike. If you haven't solved DP problems where state depends on multiple dimensions or string splitting, you'll stall. String manipulation appears light but Scramble String is recursion-heavy. Start with array and binary search drills, move to DP patterns next. StealthCoder is your hedge for whatever DP edge case you didn't have time to internalize.
Companies with similar patterns
If you prepped for Darwinbox, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Darwinbox.
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.
Darwinbox interview FAQ
How many array problems should I solve before this OA?+
At least 15 to 20. Arrays appear in four of five Darwinbox problems, so mastery is non-negotiable. Focus on subarrays, sliding windows, and two-pointer patterns. Spiral Matrix alone requires strong matrix traversal logic under time constraints.
Is dynamic programming the hardest part of this assessment?+
Yes. Two of five problems are hard and both use DP. Scramble String and Number of Great Partitions both require you to recognize overlapping subproblems and define state correctly. Solve at least five DP problems before your OA, focusing on string and array partitioning patterns.
What should I study first for Darwinbox?+
Array techniques: sliding window, prefix sum, two-pointer. These appear across four problems and are the foundation for harder patterns. Minimum Size Subarray Sum combines binary search and sliding window, so drill that pattern twice. Then move to DP.
Is binary search critical for this OA?+
It appears once in Minimum Size Subarray Sum, but you can solve that problem with two-pointer sliding window instead. Binary search isn't the bottleneck here. Arrays and DP are. Don't waste time optimizing a binary search solution if you're weak on DP basics.
Should I memorize Scramble String before the interview?+
No. Memorizing individual hard problems doesn't transfer. Instead, solve three to five similar DP problems on strings or partitions. Learn to recognize when recursion with memoization is the right tool. That pattern recognition matters more than knowing one specific solution.