Deutsche Bank coding interview
questions, leaked.
30 problems reported across recent Deutsche Bank interviews. Top patterns: array, sorting, greedy. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Deutsche Bank's coding interview hits you with 30 problems across a wide spread of difficulty. Eight are easy, but fifteen are medium and seven are hard. Arrays dominate the list (26 out of 30 problems touch arrays), and you'll see sorting, greedy, and binary search woven throughout. The median candidate doesn't have time to drill all of them before the OA. That's where StealthCoder comes in: if you freeze on a binary-search-plus-sorting hybrid mid-assessment, it surfaces a working solution in seconds, invisible to the proctor.
Top problems at Deutsche Bank
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Smallest K-Length Subsequence With Occurrences of a Letter | HARD | 100.0 | 39% | String · Stack · Greedy |
| 02 | Maximum Running Time of N Computers | HARD | 91.3 | 50% | Array · Binary Search · Greedy |
| 03 | Find the Maximum Sum of Node Values | HARD | 91.3 | 70% | Array · Dynamic Programming · Greedy |
| 04 | Apply Operations to Maximize Frequency Score | HARD | 89.1 | 36% | Array · Binary Search · Sliding Window |
| 05 | The Time When the Network Becomes Idle | MEDIUM | 89.1 | 54% | Array · Breadth-First Search · Graph |
| 06 | Maximum Coins Heroes Can Collect | MEDIUM | 89.1 | 68% | Array · Two Pointers · Binary Search |
| 07 | Minimum Operations to Make the Array Increasing | EASY | 89.1 | 81% | Array · Greedy |
| 08 | Minimum Operations to Collect Elements | EASY | 89.1 | 61% | Array · Hash Table · Bit Manipulation |
| 09 | Pour Water Between Buckets to Make Water Levels Equal | MEDIUM | 89.1 | 67% | Array · Binary Search |
| 10 | Minimize the Difference Between Target and Chosen Elements | MEDIUM | 86.6 | 36% | Array · Dynamic Programming · Matrix |
| 11 | Robot Collisions | HARD | 80.8 | 56% | Array · Stack · Sorting |
| 12 | Koko Eating Bananas | MEDIUM | 80.8 | 49% | Array · Binary Search |
| 13 | Boats to Save People | MEDIUM | 80.8 | 60% | Array · Two Pointers · Greedy |
| 14 | Collecting Chocolates | MEDIUM | 72.9 | 34% | Array · Enumeration |
| 15 | Best Time to Buy and Sell Stock | EASY | 72.9 | 55% | Array · Dynamic Programming |
| 16 | Asteroid Collision | MEDIUM | 67.8 | 46% | Array · Stack · Simulation |
| 17 | Two Sum | EASY | 67.8 | 56% | Array · Hash Table |
| 18 | Frequency of the Most Frequent Element | MEDIUM | 61.1 | 44% | Array · Binary Search · Greedy |
| 19 | Longest Common Prefix | EASY | 61.1 | 45% | String · Trie |
| 20 | Maximum Fruits Harvested After at Most K Steps | HARD | 61.1 | 37% | Array · Binary Search · Sliding Window |
| 21 | Best Time to Buy and Sell Stock II | MEDIUM | 61.1 | 70% | Array · Dynamic Programming · Greedy |
| 22 | Design HashMap | EASY | 51.7 | 66% | Array · Hash Table · Linked List |
| 23 | Validate IP Address | MEDIUM | 51.7 | 28% | String |
| 24 | Fruit Into Baskets | MEDIUM | 51.7 | 46% | Array · Hash Table · Sliding Window |
| 25 | Rotting Oranges | MEDIUM | 51.7 | 57% | Array · Breadth-First Search · Matrix |
| 26 | Reverse String | EASY | 51.7 | 80% | Two Pointers · String |
| 27 | Minimize Manhattan Distances | HARD | 51.7 | 31% | Array · Math · Geometry |
| 28 | Kth Largest Element in an Array | MEDIUM | 51.7 | 68% | Array · Divide and Conquer · Sorting |
| 29 | Spiral Matrix | MEDIUM | 51.7 | 54% | Array · Matrix · Simulation |
| 30 | Squares of a Sorted Array | EASY | 51.7 | 73% | Array · Two Pointers · Sorting |
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 Deutsche Bank OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoder- array26 · 87%
- sorting10 · 33%
- greedy7 · 23%
- binary search7 · 23%
- dynamic programming4 · 13%
- string4 · 13%
- two pointers4 · 13%
- hash table4 · 13%
- sliding window4 · 13%
- prefix sum4 · 13%
Array problems are your bread and butter here. Almost everything touches arrays, so if you're weak on iteration, slicing, and in-place operations, you'll leak points fast. Sorting appears in ten problems and works in tandem with binary search and greedy logic. Start there. Greedy, binary search, and two-pointers are your next tier (each appears in 7, 7, and 4 problems respectively). The hard problems mix these topics aggressively: 'Maximum Running Time of N Computers' chains binary search, greedy, and sorting; 'Apply Operations to Maximize Frequency Score' layers binary search with sliding window and prefix sum. The medium tier is dense but repeatable. StealthCoder is your hedge for the patterns you didn't have time to fully internalize. Hit arrays and sorting hard in prep; everything else is secondary.
Companies with similar patterns
If you prepped for Deutsche Bank, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Deutsche Bank.
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 an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Deutsche Bank interview FAQ
Should I spend more time on arrays or sorting for Deutsche Bank?+
Arrays first. They appear in 26 out of 30 problems. Sorting is crucial but it's almost always combined with arrays. Master array iteration, two-pointer techniques, and in-place manipulation before drilling sorting algorithms in isolation.
How much should I prepare on dynamic programming?+
Lower priority. Only four problems explicitly list DP, and most of those mix it with arrays and greedy. If you have time after arrays, sorting, and binary search, revisit DP. It's not your bottleneck here.
What's the hard problem profile at Deutsche Bank?+
Seven hard problems, most combining 3-4 topics. 'Maximum Running Time of N Computers' stacks binary search, greedy, and sorting. 'Apply Operations to Maximize Frequency Score' uses binary search, sliding window, and prefix sum. Expect multi-layered patterns, not isolated algorithm problems.
Is binary search worth deep drilling for this company?+
Yes. Seven problems use it, often paired with sorting or greedy logic. It's not the majority, but it shows up in some of the hardest problems. Practice binary search on arrays, then see how it plugs into max/min problems with constraints.
How many medium problems should I solve before the OA?+
Fifteen medium problems are on the list. Aim to solve eight to ten unique mediums covering arrays, sorting, greedy, and binary search before your assessment. Don't memorize; understand the pattern. That's your base.