QUESTIONS BY COMPANY

Deutsche Bank LeetCode Questions 2026

Browse LeetCode problems frequently asked by Deutsche Bank. Filter by difficulty and timeframe to focus your interview prep.

Last updated: 10 July 2026

Try CodingInterviewAI free on a practice problem

New accounts get 10 free credits for the free AI model—up to five complete problems.

Timeframe

Difficulty

Problem	Difficulty	Frequency	Topics
Two Sum	EASY	62.5%	ArrayHash Table
Longest Common Prefix	EASY	62.5%	ArrayStringTrie
Maximum Coins Heroes Can Collect	MEDIUM	100%	ArrayTwo PointersBinary SearchSortingPrefix Sum
The Time When the Network Becomes Idle	MEDIUM	100%	ArrayBreadth-First SearchGraph Theory
Smallest K-Length Subsequence With Occurrences of a Letter	HARD	100%	StringStackGreedyMonotonic Stack
Best Time to Buy and Sell Stock	EASY	62.5%	ArrayDynamic Programming
Apply Operations to Maximize Frequency Score	HARD	100%	ArrayBinary SearchSliding WindowSortingPrefix Sum
Maximum Running Time of N Computers	HARD	100%	ArrayBinary SearchGreedySorting
Pour Water Between Buckets to Make Water Levels Equal	MEDIUM	100%	ArrayBinary Search
Find the Maximum Sum of Node Values	HARD	100%	ArrayDynamic ProgrammingGreedyBit ManipulationTreeSorting
Minimum Operations to Make the Array Increasing	EASY	100%	ArrayGreedy
Minimum Operations to Collect Elements	EASY	100%	ArrayHash TableBit Manipulation
Collecting Chocolates	MEDIUM	87.5%	ArrayEnumeration
Squares of a Sorted Array	EASY	62.5%	ArrayTwo PointersSorting
Different Ways to Add Parentheses	MEDIUM	75%	MathStringDynamic ProgrammingRecursionMemoization
N-Queens II	HARD	62.5%	Backtracking
Pascal's Triangle	EASY	62.5%	ArrayDynamic Programming
Split Array With Same Average	HARD	62.5%	ArrayHash TableMathDynamic ProgrammingBit ManipulationBitmask
Count Increasing Quadruplets	HARD	62.5%	ArrayDynamic ProgrammingBinary Indexed TreeEnumerationPrefix Sum
Coin Change	MEDIUM	62.5%	ArrayDynamic ProgrammingBreadth-First Search

Find algorithm patterns and generate explained solutions.