Deutsche Bank Interview Questions, Process, and Tips for Freshers

Round duration - 90 Minutes
Round difficulty - Easy

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

Q1.  Ninja and Infinite Size Array
Ninja has been given an array/list ‘ARR’ of unknown size and an element ‘TARGET.’ The ‘ARR’ is sorted in ascending order and all the elements of the ‘ARR’ are different. Howe...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 by CodingNinjas
View 1 more amswer
Q2. Shortest Safe Route In A Field With Landmines
Recently Ninja has been learning about a new Ninja Technique to cross a field with landmines. The field is in the form of a rectangular matrix of size M x N, h...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 by CodingNinjas
View 1 more amswer
Q3. Maximum Subarray Sum
You are given an array/list ARR consisting of N integers. Your task is to find the maximum possible sum of a non-empty subarray(contagious) of this array.
Note: An array C is a subar...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 by CodingNinjas
View 2 more amswers

Round duration - 30 Minutes
Round difficulty - Easy

Morning(10 am)
The interviewer was friendly.

Q1. Add Two Numbers As Linked Lists
You are given two linked lists representing two non-negative numbers. The digits in the linked list are stored in reverse order, i.e. starting from least significant digit (...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 by CodingNinjas
View 2 more amswers
Q2. SQL Questions
Difference between Union and Union all
Two tables were present having similar schema containing some common and distinct data I had to write a query to return a table containing all the entries...read more
Add your answer
Q3. Find prime numbers
You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.
Note: A prime number is a natural number that is divisible only by 1 and itself. ...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 by CodingNinjas
View 2 more amswers

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. Technical Questions
He asked me the main features of Angular because I have written angular in the skills section of my resume.
Add your answer
Q2. SQL Question
I don't remember this question precisely but it was somewhat like this:
Two tables were given and he asked me the employee names which were most common in each city.
The tables were like this:
Tab...read more
Add your answer
Q3. Cycle Detection in a Singly Linked List
You have given a Singly Linked List of integers, determine if it forms a cycle or not.
A cycle 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 by CodingNinjas
View 2 more amswers
Q4. Implement Stack With Linked List
You need to implement the Stack data structure using a Singly Linked List.
Create a class named 'Stack' which supports the following operations(all in O(1) time):
...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 by CodingNinjas
Add your answer
Q5. System Design Question
The interviewer asked me to design a banking system in which the user can use either the current account(rate of interest 10%) or savings account(rate of interest 7%) and the function...read more
Add your answer
Q6. Find Unique
You have been given an integer array/list(ARR) of size N. Where N is equal to [2M + 1].
Now, in the given array/list, 'M' numbers are present twice and one number is present only once...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered by CodingNinjas
Add your answer
Q7. Puzzle
Suppose you have a 3 liter jug and a 5 liter jug (this could also be in gallons). The jugs have no measurement lines on them either. How could you measure exactly 4 liter using only those jugs and as...read more
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.

Q1. Basic HR Questions
Are you a team player?
What happens if your team is not working as expected?
Ans. 
Tip 1 : In this type of question try to show that you are a team player, even if one of your team members is not working properly, you can cover for his/her mistakes and talk them out of their problems.
Answered by CodingNinjas
Add your answer

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.

Q1. Basic HR Questions
Who is your role model?
What keeps you motivated?
Ans. 
Tip 1 : I had done many projects so I had a lot of answers to this question. Having projects helped me in both of my HR and Pro-fit rounds.
Answered by CodingNinjas
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

It started in the morning at 8 am. The window to start the round was of 15 mins

Q1. Print All Possible Paths From Top Left Corner To Bottom Right Corner Of A 2-D Matrix
You are given an ‘M*N’ Matrix, You need to print all possible paths from its top left corner to the bottom right corner...read more
Ans. Recursion
The basic idea to solve this problem is to use recursion. Recursively call function   for next row ( row+1,col ) and next column ( row, col+1 ). If the row is equal to M-1 or the column is equal to N-1, then recursion is stopped.
 
Algorithm:
• Take an array or vector ‘path’, which will store the path we have to print.
• Start from the index (row, col) = (0,0).
• Add mat(row, col) to  ‘path.’
• Recursively ca...read more
Answered by CodingNinjas
Add your answer
Q2.  Longest Common Substring
You have been given two strings 'STR1' and 'STR2'. You have to find the length of the longest common substring.
A string “s1” is a substring of another string “s...read more
Ans. Recursion
The basic idea is to recursively try and match characters from ‘STR1’ to characters of ‘STR2’ and vice versa also.
 
The steps are as follows:
 
• Create a ‘COUNT’ variable initialized to 0 to get the length of the longest common substring.
• Try to match the last characters of both strings. Let ‘i’ be the last index for ‘STR1’ and ‘j’ be the last index of ‘STR2’, so match ‘STR1’[i] and ‘STR2’[j].
• If they matc...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 30 minutes
Round difficulty - Easy

The interview began around 3 pm. The interviewer was strict and directly started with the interview questions.

Q1. General Questions
Explain ETF investment analysis.
Why an inclination to finance?
Professors I like and Dislike in college
Asked me to mention things that I have not highlighted in my resume.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

There were around 10 MCQS and 2 coding questions.  The MCQs mainly had questions related to DBMS and OOPs. There were also questions related to error debugging and give the output of a segment of code. Questions in DBMS were related to SQL commands. The test duration was from 5:30 to 7 pm. There were 2 questions in the coding round. The first one was based on a matrix and the second was based on dynamic programming.

Q1. Matrix Flip Bit
You have been given a binary matrix ‘MAT’ of size ‘N’ * ’N’. Let ‘i’, ’j’ denote the row and column of the matrix, respectively. If ‘MAT’[i][j] is equal to 0, flip every 1 in the ‘i’th row ...read more
Ans. 
I first applied brute force but the solution was exceeding the time limit so I looked for ways to avoid traversing every
row and column of the matrix. Take the input of the matrix and in a map stored the location of every 0 in the original matrix. Then I traversed through the matrix whenever I encountered a 0 I traversed through its row and column and counted the number of ones. I also marked the row and column visited ...read more
Answered by CodingNinjas
View 3 more amswers
Q2. Jump Game
You have been given an array 'ARR' of ‘N’ integers. You have to find the minimum number of jumps needed to reach the last index of the array i.e ‘N - 1’ if at any index ‘i’ we can jump to...read more
Ans. Brute Force Approach
• For each index, we find all possible locations we can jump to i.e if we are currently at an index ’i’ and ‘ARR[i]’ = k then we recursively find the answer for all indices from i + 1 to i + k and take the minimum of the answer and add 1 to it to find the minimum number of jumps to reach index last index from index ‘i’.
• For example, Consider the array : 2, 3, 1, 4
• We will have the following recursion tr...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 45 minutes
Round difficulty - Easy

It was an interview round that took place over skype and it lasted for about 45 minutes. My interviewer was polite and gave me time to think for a few answers and was patient when there were technical difficulties. I was also asked to share my screen and show the working code for a few of the questions asked in the interview. I used an online compiler to do so (onlinegdb). Overall the interview went pretty decent with a mix of easy and tough questions.

Q1. SQL Query
I was asked to write a query to select all the people who are below the age of 75 from a set of people.
Add your answer
Q2. OOPS
What is the diamond problem?
Ans. 
The diamond problem occurs when two superclasses of a class have a common base class. For example, in the following diagram, the TA class gets two copies of all attributes of Person class, this causes ambiguities.
Answered by CodingNinjas
Add your answer
Q3. Dijkstra's shortest path
You have been given an undirected graph of ‘V’ vertices (labeled 0,1,..., V-1) and ‘E’ edges. Each edge connecting two nodes (‘X’,’Y’) will have a weight denoting the distance betw...read more
Ans. 
I followed the same steps as given by the algorithm and also showed the output using some test cases.
Answered by CodingNinjas
View 2 more amswers
Q4. Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge sor...read more
Ans. 
I had gone through the topic of time complexities really well before the interview. Whenever you practice coding do look at the time complexities of various standard problems like merge sort or bubble sort and also know all the possible ways to do them. Do all the standard coding problems and know their optimized solutions under every topic. Make sure you know your projects thoroughly. Be confident and don't beat aroun
Answered by CodingNinjas
View 2 more amswers

Round duration - 30 minutes
Round difficulty - Easy

This was a professional fitness round. It lasted for about 20-30 minutes. I was asked general questions about my future and career and the interviewer wanted to know what kind of a person I am and if I am fit for working in their company.

Q1. HR Questions
First I was asked to introduce myself wherein I spoke about my hometown and my earlier education and also included my hobbies. Then I was asked why I wanted to work in that particular company t...read more
Ans. 
Tip 1 : Be confident
Tip 2 : Know everything there is to know about the company
Tip 3 : Know about the recent technologies that are being adopted by various companies
Tip 4 : Have answers prepared for questions like "What are your future plans" and "why do you want to work here?"
Tip 5 : Know where your interests lie in the technical field. 
Answered by CodingNinjas
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

This round was an HR round. Here I wasn't asked anything related to tech. Very general questions were asked and the purpose of this round was mainly to know if I had an aadhar card or had Indian citizenship or not or if have anyone related to me who was working in that company. Everyone who made it to this round was selected, this round wasn't to test your abilities but just to know if you can work in DB in India.

Q1. HR Questions
I was asked to introduce myself and about my hobbies and hometown. They were very general questions. It was a fun and relaxed round.
Ans. 
Tip 1 : When the interviewer asks you "How are you?" respond and ask them the same question
Tip 2 : Be polite and confident
Answered by CodingNinjas
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The test was conducted at 11 am in Hackerearth and was of 90 minutes. The time was enough to solve both the questions as well as the MCQ's. It consisted of 2 coding questions and 10 MCQs. The level of questions was medium and the mcqs ranged from easy to difficult.

Q1. Find the minimum cost to reach destination using a train
There are ‘N’ stations on the route of a train. The train goes from station 0 to ‘N’ - 1. The ticket cost for all pairs of stations (i, j) is given ...read more
Ans. 
The solution is to use DP and create a 2D table and fill the table using above given recursive formula.
minCost(0, N-1) = MIN { cost[0][n-1], cost[0][1] + minCost(1, N-1), ........, minCost(0, N-2) + cost[N-2][n-1] }
The extra space required in this solution would be O(N2) and time complexity would be O(N3).
This solution was accepted however, solution using recursion wasn't because time limit exceeded.
Answered by CodingNinjas
View 2 more amswers
Q2.  Next smaller Palindrome
You are given a number 'N' in the form of a string 'S', which is a palindrome. You need to find the greatest number strictly less than 'N' which is also a p...read more
Ans. 
There can be three different types of inputs that need to be handled separately.

The input number is palindrome and has all 9s. For example “9 9 9”. Output should be “1 0 0 1”
The input number is not palindrome. For example “1 2 3 4”. Output should be “1 3 3 1”
The input number is palindrome and doesn’t have all 9s. For example “1 2 2 1”. Output should be “1 3 3 1”.
So now you just need to think how can we iterate from mid...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 45 minutes
Round difficulty - Easy

After clearing the coding round, Video call Interview was conducted at 12 pm. The interviewer was cooperative and gave hints whenever I stuck upon any question.

Q1. Longest Consecutive Sequence
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 i...read more
Ans. 
Initially I gave the naive solution i.e, the brute force.
My second solution was to sort the array and then get the longest sequence.
I finally came to a better solution which was by using hashmaps
Answered by CodingNinjas
View 3 more amswers
Q2. DBMS
1. What is Deadlock? How this condition occurs and how to resolve it?
2. What is difference between threads and process?
Ans. 
Tip 1 : Always give a structured answer. For example, first tell the definition and then quotes a few examples in support of it.
Tip 2 : Do refer to GeekForGeeks articles for OS. Try to read as many articles as you can.
Answered by CodingNinjas
Add your answer
Q3. General Question
1. How do you tackle the situation when there is a conflict between you and one of your team members?
Ans. 
Tip 1 :You should always show a positive nature. Be confident while answering the questions.
Tip 2 : You should be able to communicate clearly and be able to express your thoughts.
Answered by CodingNinjas
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

I already gave the technical round so I wasn't that nervous. Also the interviewer was patiently listening the answers. It seemed like a normal conversation.

Q1. General Questions
1. What all projects I have done? Explain any one project in detail.
2. Why I want to join Deutsche Bank?
3. How do I see myself 5 years down the lane?
Ans. 
Tip 1 : You should be aware about the company. Spend around 1 hour before the day of the interview and do a proper research about the company and its principles.
Tip 2 : You should be clear about all the projects, the technologies used in it, why you used them specifically, the purpose of the project, etc. 
Tip 3 : Don't try to fake any achievements. The interviewer can ask tricky questions and it can become difficu
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was the last round. 15 students were selected for this round. I was tired since I already gave 2 interviews.

Q1. General Questions
1. Any situation where you showed problem-solving along with team skills?
2. What role do you want in our company?
3. Asked about one achievement mentioned in my resume.
Ans. 
Tip 1 : When talking about your skills, You can quote any example taken while making one of your college projects.
Tip 2 : For second question, What role do you want in DB?, I answered that I need a role where I can share my solutions with the team, help the company to grow and build a product which is useful.
Tip 3 : Do mention your coding achievements, it shows that you are interested in their work.
Answered by CodingNinjas
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was first entrance round which was conducted in online mode. It had 2 coding question and 10 mcqs.it was around 90 min in total and took place in evening at around 5 pm. 

Q1. Rooks Placing
You are given an n×n chessboard. Rows and columns of the board are numbered from 0 to ‘n’-1. Cell (r,c) lies at the intersection of row number 'r' and column number ‘c’.
Rook is a c...read more
Ans. 
my solution was similar to this

var allSolutions = _.memoize(function(n) {

if (!n) return [];

if (n === 1) return [[[true]]];
var solutions = [];

for (var i = 0; i < n; i++) {

_.each(allSolutions(n-1), function(nMinusOneSolution){

solutions.push(generateSolution(nMinusOneSolution, i));

});

}

return solutions;

});



var generateSolution = function(nMinusOneSolution, i) {

var n = nMinusOneSolution.length + 1;

var newSet = [];

for (var...read more
Answered by CodingNinjas
View 3 more amswers

Round duration - 40 minutes
Round difficulty - Medium

It was the first interview round conducted on skype. Each of the candidates were provided with the name of the interviewer and time slot in advance, and were expected to join to the link provided . The interviewer was really sincere and asked question straight to the point and asked me to write 2 3 codes for which he gave me questions and asked me to share my screen.

Q1. Puzzle
Alok has three daughters. His friend Shyam wants to know the ages of his daughters. Alok gives him first hint.
1) The product of their ages is 72.
 
Shyam says this is not enough information Alok ...read more
Ans. 
Tip 1 : Be calm think properly and answer
Tip 2 : Share your approaches continuously
Tip 3 : Even if you cannot get the final answer share your approach.
 
Answered by CodingNinjas
Add your answer
Q2. OOPS questions
What is virtual class, abstract class and other concepts?
Ans. 
Tip 1 : Go through oops properly
Tip 2 : Concentrate on basics
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

it was a technical and hr round .he asked me about my projects ,discussed my resume and questioned my skills and projects . He asked me why I wanted to join this company. Here also we were told about the result of previous round, interviewer and time slot in advance.

Q1. General Questions
Why do you want to join this company? Tell m about your projects
Ans. 
Tip 1 : be honest
Tip 2 : just say what you feel
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

He discussed my project and what all changes I would like to implement in near future and about resources and references We were given time slot and name of interviewer in advance.

Q1. General Questions
Questions related to my project and what all fields I have interest in
How will I manage a team if needed?
Ans. 
Tip 1 : be calm smile be confident
Tip 2 : think of the interviewer as a person you can be honest with and maintain a positive environment if you feel nervous tell him/her that you are nervous they will definitely support you.
Answered by CodingNinjas
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This was coding test. There were two question from DP and arrays respectively. I solved both questions in given time. I got shortlisted for the next round.

Q1. Rat In A Maze
You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...read more
Ans. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
 
Algorithm is as follows:
 
1. Take the starting position of th...read more
Answered by CodingNinjas
Add your answer
Q2. Ways to express ‘n’ as the sum of consecutive numbers
You are given the number ‘N’. The task is to find the number of ways to represent ‘N’ as a sum of two or more consecutive natural numbers.
Example:
N...read more
Ans. Prefix sum
Use a prefix sum array ‘prefixSum’ (with ‘prefixSum[0] = 0’) whose each index ‘i’ stores the sum of ‘i’ consecutive integers starting from ‘1’. The size of this array will be ‘x’. Here, ‘x + (x-1) <= n’,i.e, when the sum of two consecutive numbers becomes greater than ‘n’. To generate ‘prefixSum’ iterate from index ‘i = 1’ and compute ‘prefixSum[i] = prefixSum[i - 1] + i’. Let, ‘count’ is the number of way...read more
Answered by CodingNinjas
View 2 more amswers