The Online Coding Assessment
- Know which coding test your track gets, from the 2026 Codility tests to the campus format
- Plan the timed test around partial credit, since 1.5 to 2.5 solved problems has been enough
- Solve six test problems that came back more than once, each in runnable code
- Tell an old 2020 problem from a current one when you research the test
This page covers the coding test Deutsche Bank gives software engineering candidates in Technology, Data & Innovation, the technology division everyone calls TDI. Graduate applicants often meet a different set of online tests before any coding happens. The careers FAQ lists a Situational Judgment Test, a Behavioural Questionnaire and an Ability Test, with 96 hours to finish each set. The process lesson covers those.
The coding test itself isn't one fixed thing. Its platform and length change with your track and the year. The 2026 tests ran on Codility. India campus tests from 2020 to 2024 kept a steady format, on HackerEarth from 2021. Both are below, newest first, followed by the six test problems asked most often.
TDI intern vs graduate vs experienced hire coding tests
Find your row first. The newest rows are at the top.
| When | Track | Platform | What was on it |
|---|---|---|---|
| Sept 2026 | Experienced Java and Spring Boot hire, Bengaluru | Codility | Scheduled at an in-person drive alongside a technical round, then a hiring manager fitment round and HR the same day |
| 2026 | Technology apprenticeship, Pune | Codility | 10 MCQs on OOP, SQL and DBMS, DSA and core programming, plus one medium dynamic programming problem |
| 2025 | TDI intern, India campus | Not named | 10 CS MCQs and two coding problems, one of them a LeetCode hard |
| 2023 | Live coding assessment, region not stated | Codility | Three problems in 45 minutes with a panel watching |
| 2020 to 2024 | Graduate Analyst, India campus | HackerEarth from 2021 | Three coding problems in 90 minutes, scored 20, 50 and 50 |
| 2020 to 2023 | Intern, India campus | HackerEarth from 2021 | 10 CS MCQs and two coding problems |
Graduate and intern applicants in the US, UK and Germany go through the bank-wide early-careers process. Its online tests are the three listed at the top of this page, and the bank names no coding platform for any of them. Expect the coding in the technical interview at the assessment centre or Super Day. A Berlin graduate trainee around 2023 saw exactly that: 19 behavioural items online, then coding on the selection day. Experienced hires apply to a named role. The careers site says there's usually at least one interview with the business and one with HR, and that anything else, a coding test included, is optional.
Codility in 2026
The 2026 technology apprenticeship in Pune opened with a Codility assessment. It had 10 multiple-choice questions on OOP, SQL and DBMS, DSA and core programming concepts, and one medium coding problem built on dynamic programming. Plan for a medium DP problem you've never seen and still have to finish.
What came next matters as much. The face-to-face process in Pune had two technical rounds, both eliminations. Across them the candidate had to work through the assessment logic again on paper, then talk through DP, SQL, basic system design and their own RAG project in depth. An HR round closed it.
For experienced hires the one 2026 data point is a September in-person drive in Bengaluru for a senior Java and Spring Boot role. The schedule was a technical round with a Codility test, a hiring manager fitment round and an HR round, all on the same day. Plans changed on the day.
The India campus format
From 2021 to 2024 the campus tests ran on HackerEarth. For Graduate Analyst it was 90 minutes and three coding problems, usually one easy and two medium to hard, with DP in many sets. From 2020 to 2024 the scoring was 20, 50 and 50 points, with the easy one worth 20.
Intern tests were shorter on code. You got 10 MCQs on OOP, DBMS, operating systems, networks and SQL, plus two coding problems. A 2025 TDI intern put the MCQs at 4 marks each with no negative marking, and one of their two problems was a LeetCode hard. A 2023 intern test ran with webcams on, and another 2023 intern drive doubled the MCQs to 20 alongside its two problems.
The scores came from test cases, so a partial solution still earned points. One 2023 graduate fully solved two problems and passed 17 of 20 cases on the third. Candidates put the bar anywhere from 1.5 to 2.5 solved problems, and a January 2021 Graduate Analyst drive set it at 2.5 of 3. In July 2024, 44 students cleared one campus OA, and the technical rounds cut that to 22.
Partial credit changes how you spend the 90 minutes. Bank the 20-point problem fast. On each 50-pointer, submit a slow version that passes the small cases before you chase the fast one. A brute force that clears half the tests beats an elegant idea that never compiles.
The 2023 live Codility assessment
One 2023 candidate sat a Codility coding assessment with a panel watching, three problems in 45 minutes. The shapes were small and constructive. One built a palindrome of a given length from exactly K distinct letters. Another found the fewest glasses, sized 1 to N litres, that hold exactly K litres, and the last found the largest K where both K and -K appear in an array. The candidate found coding under observation hard on the nerves.
How to practice for the Deutsche Bank coding test
Practice in the format you'll face. Graduates should run three problems on a 90-minute timer with the first one easy. Interns should pair two problems with a set of CS multiple-choice questions on OOP, DBMS, operating systems, networks and SQL. Apprentices on Codility should expect the MCQs too, plus one medium problem to finish completely.
The patterns repeat more than the problems do. Greedy after a sort, a sliding window over sorted positions, prefix sums with a binary search, binary search on the answer, and DP over intervals or a single index cover all six problems below. A July 2023 intern's first technical round opened with what they called a simple one-dimensional DP question, which is a fair summary of what to drill. House robber and coin change are good warm-ups, and the dynamic programming intro covers the pattern.
Pick your language before test day. You choose it in the OA, and candidates have used Python, C++ and Java. Java draws the most follow-up questions in the live rounds, so if you'll claim it there, practise the OA in it too.
Reading Deutsche Bank OA posts on Reddit and forums
Search for the Deutsche Bank coding assessment and you'll find long problem lists, on LeetCode Discuss and GeeksforGeeks especially. Check three things before you trust one: the year, the track and the platform. Problems recur inside a season and then rotate out. In 2020 one jump-out-of-the-array problem turned up five times, and one candidate called it near constant. It hasn't been reported since. The 2021 favourites went the same way, and so did the 2023 heroes-and-monsters problem.
Most problems you'll find online were asked once. Treat one as an example of the difficulty and topic mix, and don't expect it on your screen. A post about the bank's graduate aptitude tests or an investment banking online assessment is about a different test entirely.
Asked at Deutsche Bank
Each of these came up two or three times. Five are OA problems seen between 2021 and 2025. The sixth, longest palindromic subsequence, was in a 2017 OA and a 2024 live round. Each carries its dates.
Maximize multiples of M with at most K increments
Asked three times, from August 2023 to 2025. The newest was a TDI intern test in the two-problem format with 10 MCQs, and that intern went on to a pre-placement offer.
Maximize Multiples of M With K Increments
Problem
nums of non-negative integers and two integers m and k. You may add a positive amount to any number of elements, but the total you add across the whole array can't exceed k.Return the largest number of elements that can be multiples of
m afterwards. An element that is already a multiple of m, including 0, counts without any additions.5 and 11 each need 1 to reach a multiple of 6, while 8 and 14 each need 4. Spending 2 on the cheap pair leaves 2, which buys nothing else.
Each element has a fixed price, the distance up to its next multiple of m, which is (m - value % m) % m. Sort the prices and buy the cheapest until k runs out.
Maximize Multiples of M With K Increments
Click "Run" to execute your code
value % m and m - value % m. The sort-and-buy greedy is unchanged, since elements still don't interact. It's a good extension to try once the main version passes.Maximum toys within K steps
Asked in September 2023 and in 2025. The 2025 TDI intern test set LeetCode 2106, Maximum Fruits Harvested After at Most K Steps, a hard built on sliding window and binary search. The 2023 intern version told the same story with shops and toys on a number line, which is the wording used here.
Maximum Toys Within K Steps
Problem
shops is a list of [position, toys] pairs sorted by position, and no two shops share a position. You start at start and can walk at most k units in total, moving left or right.You collect every toy at each shop you reach, including a shop at
start itself. Return the largest number of toys you can collect.Walk left to 1, which takes 3 units and collects 7 + 2 + 4. Walking right to 9 uses all 5 units and collects only 12.
The shops you visit form a contiguous range. A range from left to right costs its width plus the shorter distance from start to either end, because you walk to the nearer end first and then turn back. Slide that range over the sorted shops.
Maximum Toys Within K Steps
Click "Run" to execute your code
k costs O(k log n), slower than the window but a good answer when the interviewer asks for another approach.Coins each hero can collect
Asked three times in July and August 2023, all in campus tests for the 2024 graduate batch. In the August Graduate Analyst set on HackerEarth it was the easy problem of three in 90 minutes, labelled greedy.
Coins Each Hero Can Collect
Problem
heroes[i] is the power of hero i, monsters[j] is the power of monster j, and coins[j] is what monster j pays out when it's defeated.A hero defeats a monster when the hero's power is greater than or equal to the monster's. Each hero fights on their own and can take on every monster. Return a list with the total coins each hero can collect, in the order the heroes are given.
The hero with power 5 beats the monsters with power 1, 4 and 2 for 1 + 2 + 8 = 11. Nobody beats the monster with power 9.
Sort the monsters by power, keeping each one's coins with it, and build prefix sums of the coins. A hero collects the prefix up to the last monster with power at or below theirs, which a binary search finds.
Coins Each Hero Can Collect
Click "Run" to execute your code
Remember k distinct integers, pay for the rest
Three intern tests asked it, from 2021 to 2023. Two are 2021 HackerEarth tests with two coding problems and 10 MCQs. The third is a 2023 intern test of two coding problems and MCQs in 120 minutes. All three describe it the same way.
Remember K Distinct Integers
Problem
nums of integers and two integers k and x. You can remember at most k distinct values, and you choose which ones.Every time a value you didn't remember appears in
nums, you pay x. Return the smallest total you can pay.Remember 3 and 2, which cover five appearances. The 1 and the 4 cost 5 each.
Count how often each value appears. Remember the k most frequent values, and pay x for every appearance of the others.
Remember K Distinct Integers
Click "Run" to execute your code
max(0, distinct - k) * x, with no counting by frequency at all. The worked version below marks the change.Koko eating bananas
Two Graduate Analyst tests. A January 2021 OA had a binary search problem much like Koko eating bananas, in a three-problem set with a cutoff of 2.5. A July 2024 test set the problem itself as the 50-point second question.
Koko Eating Bananas
Problem
piles of bananas, where piles[i] is the number in pile i, and h hours before the guards return. She picks an eating speed speed, a positive integer of bananas per hour.Each hour she chooses one pile and eats
speed bananas from it. If the pile has fewer, she finishes it and waits out the rest of the hour. Return the smallest speed that lets her finish every pile within h hours. h is at least the number of piles.At 6 per hour the piles take 1 + 2 + 2 + 1 = 6 hours. At 5 they take 7.
The hours needed only go down as the speed goes up. Binary search the speed between 1 and the largest pile, and keep the smallest one whose hours fit in h.
Koko Eating Bananas
Click "Run" to execute your code
Longest palindromic subsequence
A September 2024 Graduate Analyst candidate in Pune got this in the second technical round, between bottom view of a binary tree and house robber, and went on to the most optimised solution. It was also one of two OA problems in a 2017 Graduate Analyst test. It has shown up in an OA and in a live round, so it's good practice for both.
Longest Palindromic Subsequence
Problem
s, return the length of its longest palindromic subsequence.A subsequence keeps the characters in their original order but may skip any of them. A palindrome reads the same forwards and backwards.
s has at least one character."carac" is a subsequence and a palindrome. No palindromic subsequence of length 6 exists.
Let dp[i][j] be the answer for the substring from i to j. Matching ends add 2 to the answer inside them, and otherwise you drop one end or the other.
Longest Palindromic Subsequence
Click "Run" to execute your code
Key Takeaways
- ✓The 2026 tests ran on Codility. India campus tests ran on HackerEarth from 2021 to 2024.
- ✓From 2020 to 2024, graduate campus tests set three problems in 90 minutes, intern tests two plus 10 MCQs. Partial credit counts.
- ✓Drill greedy after a sort, sliding windows, prefix sums with binary search, binary search on the answer and interval DP.
- ✓Be ready to explain your OA solution again on paper in the face-to-face round.
Deutsche Bank interview guideKnow what Deutsche Bank asks before you walk in.
28 coding · 5 system design · 29 behavioral questions
Get their questions first.
InterviewLegend is independent and not affiliated with or endorsed by any company it covers.