Deutsche Bank Software Developer Intern Interview Questions, Process, and Tips

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 Bit Flipping Problem
In this task, you're provided with a binary square matrix of size 'N * N' named MAT. The task requires you to perform row and column flips whenever a zero (0) is encountered in...read more
Ans. 
Count the total number of flips required in a binary matrix when encountering zeros.
• Iterate through the matrix and whenever a zero is encountered, flip all 1s in the corresponding row and column.

• Keep track of the total number of flips required.

• Return the total count of flips at the end.
Answered by AI
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. 
The problem involves finding the minimum number of jumps required to reach the last index of an array.
• Start from index 0 and keep track of the maximum reachable index at each step.

• Update the maximum reachable index as you iterate through the array.

• Increment the jump count when you reach the current maximum reachable index.
Answered by AI
Add your answer

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. Write a SQL query to select all the people who are below the age of 75 from a set of people.
Ans. 
SQL query to select people below age 75
• Use SELECT statement to retrieve data

• Use WHERE clause to filter out people above age 75

• Example: SELECT * FROM people WHERE age < 75
Answered by AI
Add your answer
Q2. What is the diamond problem in Object-Oriented Programming?
Ans. 
The diamond problem occurs in multiple inheritance when a class inherits from two classes that have a common ancestor.
• Occurs in multiple inheritance when a class inherits from two classes that have a common ancestor

• Results in ambiguity in the inheritance hierarchy

• Can lead to conflicts in method resolution
Answered by AI
Add your answer
Q3. 
Dijkstra's Shortest Path Problem
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...read more
Ans. 
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
• Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes.

• Use a priority queue to efficiently select the next node with the shortest distance.

• Update the distances of neighboring nodes based on the current node's distance and edge weights.

• Handle disc...read more
Answered by AI
Add your answer
Q4. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively until each array has only one element.

• Merge the sorted halves to produce a completely sorted array.

• Time complexity of Merge Sort is O(n log n).

• Example: Input: [3, 1, 4, 1, 5], Output: [1, 1, 3, 4, 5]
Answered by AI
Add your answer

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.

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.

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. 
Find the minimum cost to reach the destination via train using given ticket costs for each pair of stations.
• Create a 2D array to store the costs from each station to the final destination.

• Use dynamic programming to calculate the minimum cost to reach each station.

• Iterate through the stations and update the minimum cost based on the previous stations.

• Return the minimum cost to reach the final station.
Answered by AI
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. 
Given a palindrome number 'N' as a string, find the largest palindrome number strictly less than 'N'.
• Iterate from the middle towards the start and end of the number to find the next smaller palindrome.

• Handle cases where the middle digit is 0 by borrowing from adjacent digits.

• Ensure the resulting number does not have leading zeros, except when the answer is 0.
Answered by AI
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. 
Find the length of the longest consecutive sequence in an unsorted array of integers.
• Iterate through the array and store all elements in a set for constant time lookups.

• For each element, check if it is the start of a sequence by looking for its previous number in the set.

• Update the length of the current sequence and the maximum length found so far.

• Return the maximum length of consecutive sequence found.
Answered by AI
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 - 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. 
Given a chessboard with rooks placed, determine the maximum number of additional rooks that can be added without attacking each other.
• Iterate through each row and column to find empty cells where additional rooks can be placed.

• Keep track of the number of additional rooks that can be added and their positions.

• Output the maximum number of additional rooks and their positions in lexicographical order.
Answered by AI
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?
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. 
Implement a function to process queries on a binary matrix by flipping rows/columns and counting zeros.
• Create a binary matrix with all zeros initially.

• Process queries by flipping rows/columns and counting zeros as per query type.

• Return the count of zeros for type 2 queries.

• Handle constraints efficiently to optimize the solution.

• Example: For input M=3, N=3 and queries 1R1, 1R2, 2C1, the output should be 1.
Answered by AI
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. 
The problem involves finding the minimum number of jumps required to reach the last index of an array, where each element represents the maximum distance that can be jumped from that index.
• Start from index 0 and keep track of the maximum reachable index at each step.

• Update the maximum reachable index as you iterate through the array.

• Increment the jump count when you reach the end of the current reachable range.

• Continue
Answered by AI
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.