PlacementPrep

Deutsche Bank Placement Papers 2026

23 min read
Company Placement Papers
Advertisement Placement

Last Updated: March 2026

Deutsche Bank Placement Papers 2026 - Complete Preparation Guide

Company Overview

Deutsche Bank is a German multinational investment bank and financial services company headquartered in Frankfurt, Germany. It is one of the largest banking institutions in Europe and operates in over 58 countries with a large presence in Europe, the Americas, and Asia. Deutsche Bank offers a wide range of investment, financial, and related products and services to private individuals, corporate entities, and institutional clients.

Eligibility Criteria 2026

CriteriaRequirements
DegreeB.Tech/B.E./B.Sc./BCA/M.Tech/M.E./MCA (All branches)
Academic Percentage60% or above throughout academics
BacklogsNo active backlogs
Year of Passing2024, 2025, 2026
ExperienceFreshers (0-1 years)

CTC Package for Freshers 2026

ComponentAmount (INR)
Base Salary₹9-13 LPA
Joining Bonus₹1-2 Lakhs
Performance Bonus₹2-3 LPA
Benefits₹1.5-2 Lakhs
Total CTC₹13.5-20 LPA

Deutsche Bank Exam Pattern 2026

SectionNumber of QuestionsDurationDifficulty Level
Quantitative Aptitude18-2025 minsHigh
Logical Reasoning15-1825 minsHigh
Verbal Ability15-1825 minsMedium-High
Technical MCQ15-2025 minsHigh
Coding Section2-3 Problems60-90 minsHigh
Total~65-75 + Coding~160-190 minsHigh

Section 1: Aptitude Questions (Quantitative)

Question 1: Simplification

Simplify: 3 + 33 + 333 + 3333 + 33333

Solution:

     3
    33
   333
  3333
+33333
------
 37035

Sum = 37,035

Question 2: Percentage

A number increased by 30% gives 520. What is the number?

Solution: Let the number be x x × 1.30 = 520 x = 520/1.30 = 400

Question 3: Profit & Loss

By selling 45 oranges for ₹160, a man loses 20%. How many oranges should he sell for ₹240 to gain 20%?

Solution: SP of 45 oranges = ₹160 (20% loss) CP of 45 oranges = 160/0.8 = ₹200 CP per orange = 200/45

For 20% gain on ₹240: CP of these oranges = 240/1.2 = ₹200

Number of oranges = 200 / (200/45) = 45 oranges

Question 4: Time & Work

10 women can complete a work in 8 days and 10 children take 12 days to complete the same work. How many days will 6 women and 4 children take to complete the work?

Solution: 10 women × 8 days = 80 woman-days 10 children × 12 days = 120 child-days

1 woman = 120/80 = 1.5 children 6 women = 9 children

Total workers = 9 + 4 = 13 children

Days = 120/13 = 9.23 days ≈ 9¼ days

Question 5: Probability

Two dice are thrown. Find the probability that the sum is divisible by 4 or 6.

Solution: Total outcomes = 36

Sum divisible by 4: 4, 8, 12

  • Sum=4: (1,3), (2,2), (3,1) = 3
  • Sum=8: (2,6), (3,5), (4,4), (5,3), (6,2) = 5
  • Sum=12: (6,6) = 1

Sum divisible by 6: 6, 12

  • Sum=6: (1,5), (2,4), (3,3), (4,2), (5,1) = 5

Total favorable (excluding duplicate 12): 3+5+1+5 = 14 Probability = 14/36 = 7/18

Question 6: Average

The average of 5 numbers is 27. If one number is excluded, the average becomes 25. Find the excluded number.

Solution: Sum of 5 numbers = 5 × 27 = 135 Sum of 4 numbers = 4 × 25 = 100

Excluded number = 135 - 100 = 35

Question 7: Compound Interest

The compound interest on a sum for 2 years at 10% per annum is ₹840. What would be the simple interest on the same sum for the same period?

Solution: Let P be principal CI = P[(1.1)² - 1] = 0.21P = 840 P = 840/0.21 = ₹4000

SI = (4000 × 10 × 2)/100 = ₹800

Question 8: Ratio

If A:B = 3:4 and B:C = 8:9, find A:B:C.

Solution: A:B = 3:4 = 6:8 B:C = 8:9

A:B:C = 6:8:9

Question 9: Partnership

A starts a business with ₹3,500 and after 5 months, B joins with some capital. After a year, the profit is divided in the ratio 2:3. What is B's contribution?

Solution: A's investment = 3500 × 12 = 42000 B's investment = x × 7

42000 / 7x = 2/3 126000 = 14x x = ₹9,000

Question 10: Speed & Distance

A car travels the first 150 km at 50 km/h, next 150 km at 60 km/h, and the last 150 km at 40 km/h. Find the average speed for the whole journey.

Solution: Time1 = 150/50 = 3 hours Time2 = 150/60 = 2.5 hours Time3 = 150/40 = 3.75 hours

Total distance = 450 km Total time = 9.25 hours

Average speed = 450/9.25 = 48.65 km/h

Question 11: Mixtures

A container has 60 liters of milk. 6 liters are removed and replaced with water. This is done 3 times. Find the final milk quantity.

Solution: Final milk = 60 × (1 - 6/60)³ = 60 × (0.9)³ = 60 × 0.729 = 43.74 liters

Question 12: Number Series

Find the missing term: 2, 5, 10, 17, 26, ?

Solution: Pattern: 1²+1, 2²+1, 3²+1, 4²+1, 5²+1, 6²+1

Next term = 37

Question 13: Pipes & Cisterns

Pipe A can fill a tank in 4 hours, Pipe B in 6 hours. There's a leak that can empty the full tank in 8 hours. If all work together, how long to fill the tank?

Solution: A's rate = 1/4, B's rate = 1/6, Leak = 1/8

Net rate = 1/4 + 1/6 - 1/8 = (6+4-3)/24 = 7/24

Time = 24/7 hours = 3 3/7 hours

Question 14: Calendar

What day of the week was August 15, 1947?

Solution: 1600 years = 0 odd days 300 years = 1 odd day 46 years = 35 ordinary + 11 leap = 57 = 1 odd day (57 = 8×7 + 1)

Days from Jan 1 to Aug 15: 31+28+31+30+31+30+31+15 = 227 days = 32 weeks + 3 days = 3 odd days

Total = 0+1+1+3 = 5 = Friday

Question 15: Algebra

If 2x + 3y = 34 and (x+y)/y = 13/8, find 5y + 7x.

Solution: From (x+y)/y = 13/8: 8(x+y) = 13y 8x + 8y = 13y 8x = 5y → y = 8x/5

Substitute in 2x + 3y = 34: 2x + 3(8x/5) = 34 2x + 24x/5 = 34 (10x + 24x)/5 = 34 34x = 170 x = 5, y = 8

5y + 7x = 40 + 35 = 75

Section 2: Technical/CS Questions

Question 1: Data Structures

What is the difference between a queue and a priority queue?

  • Queue: FIFO - elements processed in insertion order
  • Priority Queue: Elements processed based on priority, highest priority first (typically implemented using heap)

Question 2: Algorithms

What is the time complexity of binary search?

Explanation: Binary search divides the search space in half with each comparison, leading to logarithmic time complexity.

Question 3: Database

What is an index in database?

Question 4: Java

Explain the concept of garbage collection.

Question 5: Networking

What is the difference between TCP and UDP?

TCPUDP
Connection-orientedConnectionless
Reliable deliveryUnreliable
Ordered deliveryNo ordering
SlowerFaster
HTTP, FTPDNS, Streaming

Question 6: Operating Systems

What is the difference between process and thread?

  • Process: Independent unit with own memory space
  • Thread: Lightweight, shares memory with other threads in same process
  • Context switch: Process is expensive, Thread is cheaper

Question 7: OOP

What is abstraction? How is it different from encapsulation?

  • Abstraction: Hiding implementation complexity, showing only functionality (achieved by abstract classes/interfaces)
  • Encapsulation: Bundling data and methods together, controlling access (achieved by access modifiers)

Question 8: SQL

Write a query to find the 3rd highest salary.

-- Method 1: Using LIMIT/OFFSET (MySQL/PostgreSQL)
SELECT DISTINCT salary 
FROM employees 
ORDER BY salary DESC 
LIMIT 1 OFFSET 2;

-- Method 2: Using subquery
SELECT MAX(salary) 
FROM employees 
WHERE salary < (SELECT MAX(salary) 
                FROM employees 
                WHERE salary < (SELECT MAX(salary) 
                               FROM employees));

Question 9: Python

What are list comprehensions? Provide an example.

# Traditional
squares = []
for x in range(10):
    squares.append(x**2)

# List comprehension
squares = [x**2 for x in range(10)]

# With condition
evens = [x for x in range(10) if x % 2 == 0]

Question 10: Software Engineering

What is Agile methodology?

  • Customer collaboration
  • Responding to change
  • Working software over documentation
  • Individuals and interactions
  • Regular feedback through sprints (typically 2-4 weeks)

Section 3: Verbal Ability/English

Question 1: Synonyms

Word closest to "CANDID":

A) Deceptive B) Frank C) Biased D) Reserved

Question 2: Antonyms

Opposite of "EQUIVOCAL":

A) Ambiguous B) Unclear C) Definite D) Vague

Question 3: Error Spotting

"One of my friend is a doctor."

Error: "friend" should be "friends"

Correct: "One of my friends is a doctor."

Question 4: Fill in Blanks

The manager was _______ with the team's performance and gave them a bonus.

A) disappointed B) furious C) delighted D) worried

Question 5: Reading Comprehension

Passage: "Sustainable finance has emerged as a critical driver in the transition to a low-carbon economy. Banks and investors are increasingly incorporating environmental, social, and governance (ESG) criteria into their decision-making processes. This shift not only addresses climate risks but also identifies new investment opportunities."

Question: What is driving the change in financial decision-making?

A) Government regulations only B) ESG criteria integration C) Higher interest rates D) Decreased risk appetite

Question 6: Analogies

ENGINEER : BUILDING :: CHEF : ?

A) Kitchen B) Recipe C) Meal D) Restaurant

Question 7: Idioms

"At the eleventh hour" means:

A) Early in the morning B) At the last possible moment C) After a long wait D) During working hours

Question 8: Para Jumbles

Arrange: P: Climate change Q: is one of the most pressing R: challenges facing S: the global economy

Question 9: One Word Substitution

A person who is unable to pay his debts:

A) Creditor B) Insolvent C) Investor D) Banker

Question 10: Sentence Improvement

"The price of the apples are high."

Correction: "The price of the apples is high."

Explanation: "Price" is singular, so use "is".

Section 4: Coding Questions

Question 1: Valid Anagram

Check if two strings are anagrams.

def is_anagram(s, t):
    """
    Time: O(n), Space: O(1) - assuming fixed alphabet
    """
    if len(s) != len(t):
        return False
    
    return sorted(s) == sorted(t)

# Efficient version
def is_anagram_efficient(s, t):
    if len(s) != len(t):
        return False
    
    from collections import Counter
    return Counter(s) == Counter(t)

# Test
print(is_anagram("anagram", "nagaram"))  # True
print(is_anagram("rat", "car"))          # False

Question 2: Missing Number

Find the missing number in range [0,n].

def missing_number(nums):
    """
    Time: O(n), Space: O(1) - using math
    """
    n = len(nums)
    expected_sum = n * (n + 1) // 2
    actual_sum = sum(nums)
    return expected_sum - actual_sum

# XOR version (avoids overflow)
def missing_number_xor(nums):
    n = len(nums)
    result = n
    for i, num in enumerate(nums):
        result ^= i ^ num
    return result

# Test
print(missing_number([3, 0, 1]))       # 2
print(missing_number([0, 1]))          # 2
print(missing_number([9,6,4,2,3,5,7,0,1]))  # 8

Question 3: Intersection of Two Arrays

Find common elements between two arrays.

def intersection(nums1, nums2):
    """
    Time: O(n + m), Space: O(min(n, m))
    """
    return list(set(nums1) & set(nums2))

# With duplicates (find common with minimum frequency)
def intersect_with_duplicates(nums1, nums2):
    from collections import Counter
    
    count1 = Counter(nums1)
    count2 = Counter(nums2)
    
    result = []
    for num in count1:
        if num in count2:
            result.extend([num] * min(count1[num], count2[num]))
    
    return result

# Test
print(intersection([1, 2, 2, 1], [2, 2]))  # [2]
print(intersect_with_duplicates([1, 2, 2, 1], [2, 2]))  # [2, 2]

Question 4: Maximum Subarray (Kadane's Algorithm)

Find the contiguous subarray with maximum sum.

def max_subarray(nums):
    """
    Time: O(n), Space: O(1) - Kadane's Algorithm
    """
    max_current = max_global = nums[0]
    
    for i in range(1, len(nums)):
        max_current = max(nums[i], max_current + nums[i])
        max_global = max(max_global, max_current)
    
    return max_global

# With subarray indices
def max_subarray_with_indices(nums):
    max_current = max_global = nums[0]
    start = end = temp_start = 0
    
    for i in range(1, len(nums)):
        if max_current + nums[i] < nums[i]:
            max_current = nums[i]
            temp_start = i
        else:
            max_current += nums[i]
        
        if max_current > max_global:
            max_global = max_current
            start = temp_start
            end = i
    
    return max_global, start, end

# Test
print(max_subarray([-2, 1, -3, 4, -1, 2, 1, -5, 4]))  # 6 ([4,-1,2,1])
print(max_subarray_with_indices([-2, 1, -3, 4, -1, 2, 1, -5, 4]))

Question 5: Happy Number

Determine if a number is happy (ends at 1 when replacing with sum of squares of digits).

def is_happy(n):
    """
    Time: O(log n) per iteration, Space: O(log n)
    """
    def get_next(num):
        total = 0
        while num > 0:
            digit = num % 10
            total += digit * digit
            num //= 10
        return total
    
    seen = set()
    while n != 1 and n not in seen:
        seen.add(n)
        n = get_next(n)
    
    return n == 1

# Floyd's Cycle Detection (O(1) space)
def is_happy_floyd(n):
    def get_next(num):
        total = 0
        while num > 0:
            digit = num % 10
            total += digit * digit
            num //= 10
        return total
    
    slow = n
    fast = get_next(n)
    
    while fast != 1 and slow != fast:
        slow = get_next(slow)
        fast = get_next(get_next(fast))
    
    return fast == 1

# Test
print(is_happy(19))   # True (1²+9²=82→68→100→1)
print(is_happy(2))    # False

Interview Tips for Deutsche Bank

1. Company Research

  • Understand Deutsche Bank's global presence
  • Know their core business areas
  • Be aware of recent restructuring initiatives
  • Understand their technology transformation

2. Technical Skills

  • Strong Java/Python programming
  • SQL proficiency
  • Understanding of microservices
  • Cloud basics (AWS/Azure)

3. Domain Knowledge

  • Investment banking basics
  • Risk management concepts
  • Regulatory compliance (MiFID, GDPR)
  • Understanding of trading systems

4. Problem Solving

  • Practice LeetCode Medium problems
  • Focus on arrays and strings
  • Hash table problems
  • Basic dynamic programming

5. Behavioral Preparation

  • Team collaboration examples
  • Handling pressure situations
  • Adaptability stories
  • Why Deutsche Bank?

6. Communication

  • Explain your approach clearly
  • Think out loud
  • Ask for clarification
  • Summarize your solution

7. Stay Updated

  • Read financial news
  • Know about European banking trends
  • Understand ESG initiatives
  • Be aware of fintech developments

Frequently Asked Questions (FAQ)

Q1: What is the interview process at Deutsche Bank?

  1. Online Assessment (Aptitude + Technical + Coding)
  2. Technical Interview (1-2 rounds)
  3. Managerial Interview
  4. HR Interview

Q2: What makes Deutsche Bank unique?

Q3: Is German language required?

Q4: How to prepare for the coding test?

Q5: What are the growth opportunities?

All the best for your Deutsche Bank placement! 🏛️

Prepare well, stay confident, and give your best shot!

Advertisement Placement

Share this article: