Deutsche Bank TDI Internship – Interview Experience (Oncampus)
- Posted
- 24 Jul 2025
Summary
I interviewed for a TDI Internship at Deutsche Bank through an on-campus process, which included an online assessment and three interview rounds. The internship offers a stipend of 75,000 per month, with a PPO compensation package around 20.2L annually upon conversion.
How it went
There were a total of four rounds in the selection process for the internship. The first round was an Online Assessment that consisted of MCQs (based on core Computer Science subjects) and two coding questions. The remaining three rounds were interviews.
🧠 Online Assessment:
The test consisted of 10 MCQs based on core Computer Science subjects such as OOPs, DBMS, OS, CN, and SQL. Each question carried 4 marks, with no negative marking.
There were 2 coding questions:
Problem 1:
You are given an array and two integers, K and M. There is an operation where any number of elements in the array can be incremented by 1 in a single operation. This operation can be performed at most K times. The goal is to find the maximum number of elements in the array that can be made divisible by M after all operations.
Problem 2:
This was a LeetCode hard-level question based on Sliding Window and Binary Search.
Reference: The question was this one.
Round 1 – Technical Interview (35 min):
- Online round focused on core CS subjects — Data Structures, OOPs in C++, OS, and DBMS.
- No DSA asked. Included 4–5 MCQs and a puzzle.
- Also had resume discussion and a short chat about Cricket.
Round 2 – Professional Fitment (30 min):
- Offline round with a friendly and interactive interviewer.
- Focused on situation-based and behavioural questions like team conflicts, handling workload, fraud scenarios, and client issues.
- Also included “Why DB?” and your strengths/weaknesses.
Round 3 – HR Round (25 min):
- Focused on behavioral and situational questions — future goals, regrets, mistakes, work pressure, and compensation.
- Ended on a positive and friendly note, with a handshake and mutual excitement about joining Deutsche Bank.
Questions asked (2)
- 01
Maximize Elements Divisible by M with K Increments
Data Structures & Algorithms
You are given an array and two integers, K and M. There is an operation where any number of elements in the array can be incremented by 1 in a single operation. This operation can be performed at most K times. The goal is to find the maximum number of elements in the array that can be made divisible by M after all operations.
- 02
Maximum Fruits Harvested After at Most K Steps
Data Structures & Algorithms · Hard
Open the problemThis was a LeetCode hard-level question based on Sliding Window and Binary Search. I was referred to this problem.
How they prepared
- Be clear about basics of programming.
- Brush up on CS subjects.
- Deutsche Bank focuses on personality, clearing the coding round was the toughest part.