Problem database last updated: June 20, 2025
28 problems · 8 Easy, 13 Medium, 7 Hard · Ranked #69 of 458
8 Easy
29% · avg 23%
13 Medium
46% · avg 59%
7 Hard
25% · avg 18%
Based on 28 reported problems, Deutsche Bank interviews are slightly harder than average - 25% Hard vs 18% across all companies.
Compared to the industry average, Deutsche Bank puts unusual emphasis on prefix-sum (10.7% of problems, 3.2x the industry average), greedy (25% of problems, 3x the industry average), sliding-window (14.3% of problems, 3x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (89.3%), sorting (32.1%), greedy (25%), binary-search (17.9%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Smallest K-Length Subsequence With Occurrences of a Letter You are given a string s, an integer k, a letter letter, and an integer repetition. | Hard | Very Likely | stringstackgreedy | Solve |
Find the Maximum Sum of Node Values There exists an undirected tree with n nodes numbered 0 to n - 1. You are given a 0-indexed 2D integer array edges of length n - 1, where edges[i] = [ui, vi] in... | Hard | Very Likely | arraydynamic-programminggreedy | Solve |
Maximum Running Time of N Computers You have n computers. You are given the integer n and a 0-indexed integer array batteries where the ith battery can run a computer for batteries[i] minutes. You... | Hard | Very Likely | arraybinary-searchgreedy | Solve |
Minimum Operations to Make the Array Increasing You are given an integer array nums (0-indexed). In one operation, you can choose an element of the array and increment it by 1. | Easy | Very Likely | arraygreedy | Solve |
Minimum Operations to Collect Elements You are given an array nums of positive integers and an integer k. | Easy | Very Likely | arrayhash-tablebit-manipulation | Solve |
The Time When the Network Becomes Idle There is a network of n servers, labeled from 0 to n - 1. You are given a 2D integer array edges, where edges[i] = [ui, vi] indicates there is a message channel... | Medium | Very Likely | arraybreadth-first-searchgraph | Solve |
Apply Operations to Maximize Frequency Score You are given a 0-indexed integer array nums and an integer k. | Hard | Very Likely | arraybinary-searchsliding-window | Solve |
Minimize the Difference Between Target and Chosen Elements You are given an m x n integer matrix mat and an integer target. | Medium | Very Likely | arraydynamic-programmingmatrix | Solve |
Koko Eating Bananas Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. | Medium | Very Likely | arraybinary-search | Solve |
Robot Collisions There are n 1-indexed robots, each having a position on a line, health, and movement direction. | Hard | Very Likely | arraystacksorting | Solve |
Boats to Save People You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of lim... | Medium | Very Likely | arraytwo-pointersgreedy | Solve |
Collecting Chocolates You are given a 0-indexed integer array nums of size n representing the cost of collecting different chocolates. The cost of collecting the chocolate at the ind... | Medium | Likely | arrayenumeration | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Likely | arraydynamic-programming | Solve |
Asteroid Collision We are given an array asteroids of integers representing asteroids in a row. The indices of the asteroid in the array represent their relative position in space... | Medium | Likely | arraystacksimulation | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Likely | arrayhash-map | Solve |
Frequency of the Most Frequent Element The frequency of an element is the number of times it occurs in an array. | Medium | Likely | arraybinary-searchgreedy | Solve |
Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. | Easy | Likely | arraystringtrie | Solve |
Maximum Fruits Harvested After at Most K Steps Fruits are available at some positions on an infinite x-axis. You are given a 2D integer array fruits where fruits[i] = [positioni, amounti] depicts amounti fru... | Hard | Likely | arraybinary-searchsliding-window | Solve |
Best Time to Buy and Sell Stock II You are given an integer array prices where prices[i] is the price of a given stock on the ith day. | Medium | Likely | arraydynamic-programminggreedy | Solve |
Reverse String Write a function that reverses a string. The input string is given as an array of characters s. | Easy | Likely | two-pointersstring | Solve |
Kth Largest Element in an Array Given an integer array nums and an integer k, return the kth largest element in the array. | Medium | Likely | arraydivide-and-conquersorting | Solve |
Squares of a Sorted Array Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order. | Easy | Likely | arraytwo-pointerssorting | Solve |
Rotting Oranges You are given an m x n grid where each cell can have one of three values: | Medium | Likely | arraybreadth-first-searchmatrix | Solve |
Design HashMap Design a HashMap without using any built-in hash table libraries. | Easy | Likely | arrayhash-tablelinked-list | Solve |
Validate IP Address Given a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is not a correct IP of any type. | Medium | Likely | string | Solve |
Minimize Manhattan Distances You are given an array points representing integer coordinates of some points on a 2D plane, where points[i] = [xi, yi]. | Hard | Likely | arraymathgeometry | Solve |
Fruit Into Baskets You are visiting a farm that has a single row of fruit trees arranged from left to right. The trees are represented by an integer array fruits where fruits[i] i... | Medium | Likely | arrayhash-tablesliding-window | Solve |
Spiral Matrix Given an m x n matrix, return all elements of the matrix in spiral order. | Medium | Likely | arraymatrixsimulation | Solve |
Smallest K-Length Subsequence With Occurrences of a Letter
SolveYou are given a string s, an integer k, a letter letter, and an integer repetition.
Find the Maximum Sum of Node Values
SolveThere exists an undirected tree with n nodes numbered 0 to n - 1. You are given a 0-indexed 2D integer array edges of length n - 1, where edges[i] = [ui, vi] in...
Maximum Running Time of N Computers
SolveYou have n computers. You are given the integer n and a 0-indexed integer array batteries where the ith battery can run a computer for batteries[i] minutes. You...
Minimum Operations to Make the Array Increasing
SolveYou are given an integer array nums (0-indexed). In one operation, you can choose an element of the array and increment it by 1.
Minimum Operations to Collect Elements
SolveYou are given an array nums of positive integers and an integer k.
The Time When the Network Becomes Idle
SolveThere is a network of n servers, labeled from 0 to n - 1. You are given a 2D integer array edges, where edges[i] = [ui, vi] indicates there is a message channel...
Apply Operations to Maximize Frequency Score
SolveYou are given a 0-indexed integer array nums and an integer k.
Minimize the Difference Between Target and Chosen Elements
SolveYou are given an m x n integer matrix mat and an integer target.
Koko Eating Bananas
SolveKoko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours.
Robot Collisions
SolveThere are n 1-indexed robots, each having a position on a line, health, and movement direction.
Boats to Save People
SolveYou are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of lim...
Collecting Chocolates
SolveYou are given a 0-indexed integer array nums of size n representing the cost of collecting different chocolates. The cost of collecting the chocolate at the ind...
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Asteroid Collision
SolveWe are given an array asteroids of integers representing asteroids in a row. The indices of the asteroid in the array represent their relative position in space...
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Frequency of the Most Frequent Element
SolveThe frequency of an element is the number of times it occurs in an array.
Longest Common Prefix
SolveWrite a function to find the longest common prefix string amongst an array of strings.
Maximum Fruits Harvested After at Most K Steps
SolveFruits are available at some positions on an infinite x-axis. You are given a 2D integer array fruits where fruits[i] = [positioni, amounti] depicts amounti fru...
Best Time to Buy and Sell Stock II
SolveYou are given an integer array prices where prices[i] is the price of a given stock on the ith day.
Reverse String
SolveWrite a function that reverses a string. The input string is given as an array of characters s.
Kth Largest Element in an Array
SolveGiven an integer array nums and an integer k, return the kth largest element in the array.
Squares of a Sorted Array
SolveGiven an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.
Rotting Oranges
SolveYou are given an m x n grid where each cell can have one of three values:
Design HashMap
SolveDesign a HashMap without using any built-in hash table libraries.
Validate IP Address
SolveGiven a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is not a correct IP of any type.
Minimize Manhattan Distances
SolveYou are given an array points representing integer coordinates of some points on a 2D plane, where points[i] = [xi, yi].
Fruit Into Baskets
SolveYou are visiting a farm that has a single row of fruit trees arranged from left to right. The trees are represented by an integer array fruits where fruits[i] i...
Spiral Matrix
SolveGiven an m x n matrix, return all elements of the matrix in spiral order.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Deutsche Bank interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Deutsche Bank interviews focus heavily on array, sorting, greedy problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Deutsche Bank interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Deutsche Bank has been reported to ask 28 distinct coding problems. The most common topics are array, sorting, greedy. 8 are Easy difficulty, 13 are Medium, and 7 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 28 reported problems, Deutsche Bank interviews are slightly harder than average - 25% Hard vs 18% across all companies. 46% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, sorting, greedy. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Deutsche Bank coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Deutsche Bank interview with AIarrow_forward
