Deutsche Bank Interview Questions, Process, and Tips

Q1. Very simple process Knowledge check
Add your answer
Q2. General Manager interview questions
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The coding round consisted of 3 coding questions. 1st question was of 20 marks, 2nd and 3rd of 50 marks.

Q1. 
Minimum Number of Operations Problem Statement
Given an array 'ARR' consisting of 'N' positive integers, determine the minimum number of operations needed to make all elements of the array equal. You may ...read more
Ans. Brute Force
For making all elements equal you can select a target value and then you can make all elements equal to that. Now, for converting a single element to a target value you can perform a single operation only once. In this manner, you can achieve your task in the maximum of  ‘N’ operations but you have to minimize this number of operations and for this, your selection of target is very important because if ...read more
Answered Anonymously
Add your answer
Q2. 
Avoiding Traps Problem Statement
Given an array of obstacles' coordinates, determine the minimal jump length to reach beyond all obstacles starting from coordinate 0 while avoiding landing on any obstacle...read more
Ans. 
I first made an array in the main function that will contain the number of prime numbers less than or equal to the index value of the array and passed into my called function. This will give me the a value for each test case. Then, int the called function I applied dynamic programming. I created a dp array and initialized all values to max integer (dp[0] = 0). For each index i, i put dp[i+1] if (i=(r1/r2)) equal to min...read more
Answered Anonymously
Add your answer
Q3. 
Longest Consecutive Sequence Problem Statement
You are given an unsorted array/list ‘ARR’ of ‘N’ integers. Your task is to return the length of the longest consecutive sequence.
The consecutive sequence ...read more
Ans. Brute Force
As we only need the consecutive elements in the form ['NUM', 'NUM' + 1, 'NUM' + 2,...,'NUM' + 'L']. The brute force approach is to traverse each element in the array ('NUM' = ‘ARR[i]’) and then keep finding ('NUM' + 1) in the array until we don't find the next consecutive element in the array.
 
Keep a track of the current length of the sequence. If the current length of the consecutive subsequence is gre...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Timing: 10:15 - 11:00 am.
The interview was online from home.

Round duration - 45 minutes
Round difficulty - Medium

Timing: 2:15 - 3:00 PM
The interview was online from home.
There were a few audio cuts in the video call but we were able to manage regardless.

Q1. 
Reverse a String Problem Statement
Given a string STR containing characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.
Input:
The input starts with a single i...read more
Ans. 
He asked me to write a function to reverse a string of size n. In this question I defined my string ans="" , then iterated i from n-1 to 0 and concatenated Character.toString(s.charAt(i)) to my ans and then returned ans. He followed up the question. He said “If I remove ' ”="" ' in string ans line then what will happen. I answered that it will give me a compilation error that the variable "ans" is not initialized. Then...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

6-7:30 pm
The webcam was on throughout the test.

Q1. 
Ninja and Infinite Size Array Problem Statement
Given an array/list ‘ARR’ of unknown size, sorted in ascending order with all distinct elements, and an element ‘TARGET’, find the position of 'TARGET' in t...read more
Ans. Linear Search
As we know, all elements of ‘ARR’ are different. So, we can simply iterate through the ‘ARR’, and if ‘readValueAtIndex(i)’ equal to the ‘TARGET’. Then we return this position. If while traversing through the ‘ARR’ if we reach at the end of the ‘ARR’ then return -1.
 
The steps are as follows:
 
1. We run a loop for ‘i ’= 0 to ‘readValueAtIndex(i) != 10^9+7:
   • If ‘readValueAtIndex(i)’ == ‘TARGET’:
     • Return ‘i’...read more
Answered Anonymously
Add your answer
Q2. 
Shortest Safe Route in a Field Problem Statement
Ninja wants to cross a field represented as a rectangular matrix of size M x N, containing landmines. A landmine gets triggered if a person is within one c...read more
Ans. Using Backtracking
• A brute force approach could be to generate all the possible paths from the first column of the field to the last column and choose the one with the shortest length.
• The idea is to use the concept of backtracking.
• Firstly we mark all the unsafe cells as 0 which are 1. This is done so as to avoid generating paths passing through an unsafe cell.
• Then for each safe cell in the first column, we generate the ...read more
Answered Anonymously
Add your answer
Q3. 
Maximum Subarray Sum Problem Statement
Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
Example of Sub...read more
Ans. Brute Force
We will iterate through all possible boundaries of the subarrays in the given array with the help of two nested loops. 
 
Then, we will iterate through each subarray with the help of another loop and find the sum of the subarray. We will maintain the maximum subarray sum through our iterations and finally return it.
Space Complexity: O(1)Explanation:
O(1), constant space is used.
Time Complexity: O(n^3...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Morning(10 am)
The interviewer was friendly.

Q1. 
Add Two Numbers Represented as Linked Lists
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...read more
Ans. Recursion
• A simple approach could be to recursively add the nodes of the linked list while keeping track of the carry generated.
• The idea behind this approach is the same as finding the sum of two numbers manually on a paper, where we start by adding the LSD and move on till the MSD. Also, keeping track of the carry generated in every iteration.
• As the linked lists represent the numbers in reverse order, the LSD occurs at...read more
Answered Anonymously
Add your answer
Q2. 
Prime Numbers Identification
Given a positive integer N, your task is to identify all prime numbers less than or equal to N.
Explanation:
A prime number is a natural number greater than 1 that has no po...read more
Ans. Brute force approach
We use Brute Force to solve this problem.
 
1. We iterate from 2 to N.
2. For each number num, we check if it is prime or not. We use the following approach to check if a given number is prime.
   1. We loop through all numbers from 2 to num - 1.
   2. For every number in the loop, we check if it divides num.
   3. If we find any number that divides num, we can say num is not prime.
   4. If num is prime, we store it in the result...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Afternoon around 12 PM
If was from home
The interviewer was professional and did not waste any time.

Q1. What are the main features of Angular?
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. Outer And Inner Loop
We are going to have two loops outer-loop and inner-loop 
1. Maintain a count of the number of nodes visited in outer-loop.
2. For every node of the outer-loop, start the inner loop from head.
3. If the inner-loop visits the node next to the outer-loop node, then return true, else repeat the process for the next iteration of outer-loop.
4. If outer-loop reaches the end of list or null, then return false.
Space ...read more
Answered Anonymously
Add your answer
Q3. 
Implement Stack with Linked List
Your task is to implement a Stack data structure using a Singly Linked List.
Explanation:
Create a class named Stack which supports the following operations, each in O(1...read more
Ans. Best Approach
1. Maintain a linked list. Keep track of its head, and size at all times, and update them accordingly whenever a new operation is performed.
2. Following is the way we can implement all functions of the stack using linked list:
   1. First, initialize a head node, and the size of the list as NULL and 0 respectively.
   2. Then for push function, insert new elements at the head of the list, i.e. the new element will become the ...read more
Answered Anonymously
Add your answer
Q4. 
Find Unique Element in Array
You have been provided an integer array/list ARR of size N. Here, N is equivalent to 2M + 1 where each test case has M numbers appearing twice and one number appearing exactly...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

They were calling it a pro-fitness round, it was to check if you are professionally fit to work in the company.
It was in the late afternoon around 3 PM
The interviewer was very friendly and engaging.

Round duration - 20 Minutes
Round difficulty - Easy

It was in the evening around 5 PM
The locations and work culture was discussed in that round 
The interviewer was exhausted.