Deutsche Bank Interview Questions, Process, and Tips

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 Problem Statement
You are given an n×n chessboard where rows and columns are numbered from 0 to n-1. Each cell (r, c) is located at the intersection of row 'r' and column 'c'. A rook is a ch...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 Anonymously
Add your answer

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.

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. Why do you want to join this company, and can you tell me about your projects?
Ans. 
Tip 1 : be honest
Tip 2 : just say what you feel
Answered Anonymously
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.

Round duration - 90 minutes
Round difficulty - Medium

The test started at 4 in the afternoon. It was online coding test from home only.

Q1. 
Query and Matrix Problem Statement
You are given a binary matrix with 'M' rows and 'N' columns, initially consisting of all 0s. You will receive 'Q' queries, which can be of four types:
Query 1: 1 R inde...read more
Ans. Brute Force
A simple idea is to traverse the given row or column. If you come across a query that is of type 1 then swap 0 with 1 and vice-versa and for the query of type 2 initialize a variable ‘COUNT’ and increment count when you encounter ‘0’ and return ‘COUNT’.
 
The steps are as follows:
 
• If the type of query is 1.
  • If we have to consider row ‘R’ at the given ‘INDEX’
    • Run a loop for row ‘INDEX’  and every c...read more
Answered Anonymously
Add your answer
Q2. 
Jump Game Problem Statement
In this problem, you are given an array ARR consisting of N integers. Your task is to determine the minimum number of jumps required to reach the last index of the array N - 1....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 Anonymously
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

Timing was 11 a.m. approximately. It was an online technical round.

Round duration - 30 Minutes
Round difficulty - Medium

This was the ProFit(Professional Fitment) Round to check if we are suitable for their company and if we find their company suitable for ourselves.
Timing was around p.m.

Round duration - 10 Minutes
Round difficulty - Easy

Timing was around 9 p.m.

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 via Train
Given 'N' stations on a train route, where the train travels from station 0 to 'N'-1, determine the minimum cost to reach the final station using 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 Anonymously
Add your answer
Q2. 
Next Smaller Palindrome Problem Statement
You are provided with a palindrome number 'N' presented as a string 'S'. The task is to determine the largest palindrome number that is strictly less than 'N'.
I...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 Anonymously
Add your answer

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 Problem Statement
You are provided with an unsorted array/list ARR of N integers. Your task is to determine the length of the longest consecutive sequence present in the array...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 Anonymously
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.

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.

Round duration - 40 minutes
Round difficulty - Easy

First round took place at around 10:15 AM. It was a online round. The interviewer was very sweet, and he asked me if i knew about the problems before

Q1. 
Next Smaller Palindrome Problem Statement
You are given a palindrome number represented as a string S. Your task is to find the largest palindrome number that is strictly less than S.
Example:
Input:
T...read more
Ans. Brute Force
• Given the fact that the input number is a palindrome itself makes this problem very trivial.
• Let us assume that the given string str is a palindrome, so we know that ‘S’ comprises of two halves  ‘S₁’ and ‘S₂’ i.e ‘S’ = ‘S₁' + ‘S₂', where ‘S₁' and ‘S₂’ are two strings, and ‘S₂’ is the reverse of ‘S₁’(in case of odd length palindromes ‘S₂’ won’t have the last character of ‘S₁’). So a change in any of the h...read more
Answered Anonymously
Add your answer
Q2. Can you explain how heaps are implemented?
Ans. 
Step 1: Heaps require the property of sorting themselves such that the smallest or largest element is at the top. So we need something that can sort itself in reasonable time complexity every-time a new element is added or deleted. A good way to get that is a binary search tree which can do this in O(log n).
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It took place at around 3:15 PM.

Q1. 
Sort a Stack Problem Statement
You are provided with a stack consisting of 'N' integers. The goal is to sort this stack in descending order by utilizing recursion.
Allowed Stack Operations:
is_empty(S) ...read more
Ans. 
Sorted it using recursion, wherein the current element (top) is taken out and the function called by recursion to sort the remaining stack. Then the element is inserted in its right place.
Answered Anonymously
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

HR round
took place in the evening at around 7:20 PM.

Round duration - 90 minutes
Round difficulty - Medium

The test was conducted at around 4 pm on Hackerearth and was of 90 minutes.It consisted of 2 coding questions and 10 MCQs.The first coding question was an easy algorithm and hash table based question, while the 2nd was of medium level and of DP.The difficulty of MCQs varied from easy to hard.

Q1. 
Matrix Cell Value Placement
You are provided with an integer N representing the size of an N * N matrix. Initially, each cell of the matrix is empty. You are also given a number K, indicating the number o...read more
Ans. 
After every task, no. of empty cells are given by:
(n-row.size())*(n-col.size())
where row and col are 2 sets and we push each i,j into it.
Answered Anonymously
Add your answer
Q2. 
Minimum Cost to Reach the End Problem Statement
Given an array of integers ARR and an integer 'K', your goal is to reach the end of the array starting from the beginning with minimum cost. You can move fr...read more
Ans. 
This is a DP based problem.
The state is the index you are currently at and the transition is the forward and backward jumps.
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Hard

It was early morning around 10A.M. shortly after their PPTs.
The interview was conducted via Skype.
It started with a an introductory question of Tell me about yourself.I was asked about my favourite subject.
The interviewer was really helpful.
I was given questions to code on arrays along with theoritical questions of Trees, LinkedLists, OOPs and DBMS.
I was also made to write a few SQL queries.
In the end I was asked if I had any question, to which I asked one.

Round duration - 30 minutes
Round difficulty - Medium

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 Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...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 Anonymously
Add your answer
Q2. 
Consecutive Sum Representation of a Number
Find the number of ways the given number 'N' can be expressed as the sum of two or more consecutive natural numbers.
Example:
Input:
N = 9
Output:
2
Explan...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 Anonymously
Add your answer