InterviewLegend

The Online Coding Assessment

Alex Chen40 min readGuide updated
In this lesson
  • 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.

The Deutsche Bank angle
Expect to explain your OA code again, face to face. The 2026 Pune apprentice who passed the Codility test had to re-solve its logic with pen and paper in the next round. Write a solution you can defend line by line, and remember how you got there after you submit.

TDI intern vs graduate vs experienced hire coding tests

Find your row first. The newest rows are at the top.

WhenTrackPlatformWhat was on it
Sept 2026Experienced Java and Spring Boot hire, BengaluruCodilityScheduled at an in-person drive alongside a technical round, then a hiring manager fitment round and HR the same day
2026Technology apprenticeship, PuneCodility10 MCQs on OOP, SQL and DBMS, DSA and core programming, plus one medium dynamic programming problem
2025TDI intern, India campusNot named10 CS MCQs and two coding problems, one of them a LeetCode hard
2023Live coding assessment, region not statedCodilityThree problems in 45 minutes with a panel watching
2020 to 2024Graduate Analyst, India campusHackerEarth from 2021Three coding problems in 90 minutes, scored 20, 50 and 50
2020 to 2023Intern, India campusHackerEarth from 202110 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.

1

Maximize Multiples of M With K Increments

MediumFrequently asked
Problem
You're given an array 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.
Inputnums = [5, 8, 11, 14]m = 6k = 4Output2

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.

How this uses the pattern

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.

Write it here, or go full screen with the problem, hints and solution beside the editor.

Maximize Multiples of M With K Increments

Loading...
Click "Run" to execute your code
The Deutsche Bank angle
Watch the wording, because it drifts. In 2023 and 2024 the total you add couldn't pass k, which is the version worked here. The 2025 version spoke of +1 operations used at most k times, which could mean one operation bumps several elements at once. Check the sample before you code. Under a shared budget, each element is a separate purchase with a fixed price, so cheapest first is optimal. Be ready to say why in one sentence.
Take it further
Let elements move down too. If an element may also be decreased, its price becomes the smaller of 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.

2

Maximum Toys Within K Steps

HardCommonly asked
Problem
Shops sit on a number line. 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.
Inputshops = [[1,4],[3,2],[4,7],[9,5],[10,1]]start = 4k = 5Output13

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.

How this uses the pattern

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.

Write it here, or go full screen with the problem, hints and solution beside the editor.

Maximum Toys Within K Steps

Loading...
Click "Run" to execute your code
The Deutsche Bank angle
The 2025 candidate called it a LeetCode hard, and it was one of only two problems in the intern test, so solving it is a big share of the score. The insight to say out loud is the turn. You never zigzag more than once, so any route covers a contiguous range of shops and turns at most one time. Once you can price a range in O(1), a sliding window gives O(n). A binary search over prefix sums also works, which is why the candidate mentioned both.
Take it further
Solve it a second way, with prefix sums and binary search. Fix how far you walk left first, and the farthest point you can reach on the right is fixed too. A prefix sum over toys and two binary searches price that route in O(log n). Trying every left distance up to 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.

3

Coins Each Hero Can Collect

EasyCommonly asked
Problem
In a battle royale game there are N heroes and M monsters. 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.
Inputheroes = [1, 3, 5, 2, 4]monsters = [1, 4, 2, 9]coins = [1, 2, 8, 4]Output[1, 9, 11, 9, 11]

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.

How this uses the pattern

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.

Write it here, or go full screen with the problem, hints and solution beside the editor.

Coins Each Hero Can Collect

Loading...
Click "Run" to execute your code
The Deutsche Bank angle
This was the easy problem in its set, so it's points to bank quickly. The brute force, every hero against every monster, passes the small cases and earns partial credit. The full marks go to sort, prefix sums and binary search. Hold onto two details. Ties go to the hero, so you want the upper bound, and the coins have to travel with their monster when you sort.
Take it further
Each monster can be defeated only once. If heroes fight in order and a defeated monster is gone, the problem changes from independent lookups to an assignment question. Try it as practice. The answer now depends on the fight order, and a greedy over sorted heroes is the natural first idea to test.

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.

4

Remember K Distinct Integers

EasyCommonly asked
Problem
You're given a list 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.
Inputnums = [1, 2, 2, 3, 3, 3, 4]k = 2x = 5Output10

Remember 3 and 2, which cover five appearances. The 1 and the 4 cost 5 each.

How this uses the pattern

Count how often each value appears. Remember the k most frequent values, and pay x for every appearance of the others.

Write it here, or go full screen with the problem, hints and solution beside the editor.

Remember K Distinct Integers

Loading...
Click "Run" to execute your code
The Deutsche Bank angle
The recalled statement is two sentences long, and it reads two ways. You might pay once for each extra distinct value, or once for every appearance of a value you forgot. The per-appearance reading is worked here because choosing what to remember makes it a real problem. The other is a one-line change, shown below. On the real test, the sample output settles which one they mean, so compute it by hand before you code.
Take it further
Pay once per forgotten value. If the fee is per extra distinct value, the answer is 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.

5

Koko Eating Bananas

MediumCommonly asked
Problem
Koko has 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.
Inputpiles = [4, 9, 11, 3]h = 6Output6

At 6 per hour the piles take 1 + 2 + 2 + 1 = 6 hours. At 5 they take 7.

How this uses the pattern

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.

Write it here, or go full screen with the problem, hints and solution beside the editor.

Koko Eating Bananas

Loading...
Click "Run" to execute your code
The Deutsche Bank angle
In the 2024 set the first two questions were both binary search, and this was the 50-point one. It tests whether you can search the space of answers rather than the array. Say why that's allowed before you code it. A faster speed never takes more hours, so the speeds that work form one block at the top. Then get the ceiling division right in integers, because floating point rounds wrong on large piles.
Take it further
Same template, different story. Any problem where you can check a guessed answer in one pass, and the check only flips once, fits this shape. Capacity to Ship Packages Within D Days, LeetCode 1011, is the closest next one to practise.

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.

6

Longest Palindromic Subsequence

MediumSometimes asked
Problem
Given a string 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.
Inputs = "character"Output5

"carac" is a subsequence and a palindrome. No palindromic subsequence of length 6 exists.

How this uses the pattern

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.

Write it here, or go full screen with the problem, hints and solution beside the editor.

Longest Palindromic Subsequence

Loading...
Click "Run" to execute your code
The Deutsche Bank angle
A working table wasn't the end of the 2024 round. For this problem the optimised version usually means cutting the O(n²) table to one row, the follow-up below. Be ready to state the recurrence in words, then the order you fill the table in. Fill i from the end of the string, because each cell reads the row below it. If the OA's medium DP problem comes back on paper, as it did in 2026, this is the kind of explanation that round asks for.
Take it further
Cut the space to O(n). Each row of the table only reads the row below it and the cell to its left, so one array plus a saved diagonal value is enough. That's the usual meaning of the most optimised version, and it's worked below.

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 guide

Know what Deutsche Bank asks before you walk in.

28 coding · 5 system design · 29 behavioral questions

Get Premium$49 a year · Instant access
Or start freeNo card.

Get their questions first.

What Deutsche Bank TestsHad your Deutsche Bank interview?How we research

InterviewLegend is independent and not affiliated with or endorsed by any company it covers.