DSA Doctor
Verified Company Vault
Deutsche Bank DSA Interview Questions
21 curated coding interview questions directly asked in Deutsche Bank technical rounds, sorted by frequency with recency and difficulty diagnostics.
21
Total Questions
7 (33%)
Easy Problems
7 (33%)
Medium Problems
7 (33%)
Hard Problems
🔥 Most Tested Topics:
Arrays (8)Core DSA (8)Dynamic Programming (2)Strings (2)Graphs (1)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2838 | Maximum Coins Heroes Can Collect | Medium | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 68.8% | 100.0% | all |
| 2039 | The Time When the Network Becomes Idle | Medium | Graphs | BFS / DFS / Topological Sort | 55.6% | 100.0% | all |
| 2030 | Smallest K-Length Subsequence With Occurrences of a Letter | Hard | Strings | Hashing / Sliding Window | 39.8% | 100.0% | all |
| 2968 | Apply Operations to Maximize Frequency Score | Hard | Core DSA | Implementation / Reasoning | 38.9% | 100.0% | all |
| 2141 | Maximum Running Time of N Computers | Hard | Arrays | Sorting / Prefix / Scan | 56.5% | 100.0% | all |
| 2137 | Pour Water Between Buckets to Make Water Levels Equal | Medium | Core DSA | Implementation / Reasoning | 68.5% | 100.0% | all |
| 3068 | Find the Maximum Sum of Node Values | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 69.4% | 100.0% | all |
| 1827 | Minimum Operations to Make the Array Increasing | Easy | Arrays | Sorting / Prefix / Scan | 82.0% | 100.0% | all |
| 2869 | Minimum Operations to Collect Elements | Easy | Arrays | Sorting / Prefix / Scan | 62.4% | 100.0% | all |
| 2735 | Collecting Chocolates | Medium | Core DSA | Implementation / Reasoning | 35.0% | 87.5% | all |
| 241 | Different Ways to Add Parentheses | Medium | Strings | Hashing / Sliding Window | 73.3% | 75.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | all |
| 122 | Best Time to Buy and Sell Stock II | Medium | Core DSA | Implementation / Reasoning | 71.1% | 62.5% | all |
| 977 | Squares of a Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 73.8% | 62.5% | all |
| 52 | N-Queens II | Hard | Backtracking | Backtracking | 78.7% | 62.5% | all |
| 118 | Pascal's Triangle | Easy | Core DSA | Implementation / Reasoning | 78.9% | 62.5% | all |
| 805 | Split Array With Same Average | Hard | Arrays | Sorting / Prefix / Scan | 27.0% | 62.5% | all |
| 2552 | Count Increasing Quadruplets | Hard | Core DSA | Implementation / Reasoning | 34.5% | 62.5% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 62.5% | all |