Deutsche Bank
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I was interviewed before Sep 2020.
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.
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...
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.
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
....
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.
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.
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
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
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,...
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...
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.
The Merge Sort...
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]
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.
Tip 1 : Strengthen DSA skills initially, know the basics and understand the working of different data structures
Tip 2 : Learn to implement them and enhance your coding skills. Make mistakes and learn from them instead of just cramming everything before practicing.
Tip 3 : To enhance coding skills, try your best to crack a question instead of giving up and looking at the solution..this will improve your problem-solving skills.
Tip 4 : It's a must to do the standard coding questions under every category of data structure and algorithms
Tip 5 : To study the topics and practice coding questions refer to GeeksforGeeks and regularly take part in coding contests at CodeForces.
Tip 6 : Be thorough with OOPs and DBMS for interview
Tip 7 : Have at least 2 projects in your resume and make sure you can answer the questions related to them.
Tip 1 : Make sure your resume fits everything into a single page.
Tip 2 : Have at least 2 projects on your resume.
Tip 3 : Mention only those technical skills that you are confident in.
Tip 4 : Include an objective in your resume.
I was interviewed before Sep 2020.
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.
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...
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.
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.
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.
Tip 1 : Have steadiness in competitive programming
Tip 2 : Make your basics very strong
Tip 3 : Do some projects
Tip 1 : Have a clear and developmental resume i.e mention your achievements year wise
Tip 2 : Try not to mention your primary educations details and achievements until they are something really extraordinary
Tip 3 : mention and elaborate your projects properly yet concisely.
I was interviewed before Sep 2020.
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.
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...
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.
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'.
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.
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.
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...
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.
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.
Tip 1 : Having proper knowledge over Data Structures and Algorithms is crucial. Have your concepts cleared and then select one coding platform( for example, leetcode, CodeZen, GeeksForGeeks) and try to practice at least 5 questions everyday topic-wise. I completed around 300+ questions on leetcode, 100+ questions on geeks for geeks and around 30-40 problems on InterviewBit.
Tip 2 : Focus on time and space complexity. Students usually ignore this fact. However, you should think about how you can optimize your code further. Hence, instead of trying to solve more problems, try to analyze it.
Tip 3 : It sometimes gets easy to demotivate but you need to keep practicing daily. Don't cut down your sleep and diet. Healthy lifestyle and personality development also plays a crucial part.
Tip 1 : Do not mention those skills, projects or achievements which you haven't achieved. The interviewer is intelligent enough to verify them.
Tip 2 : Do not keep your resume too long, and do not mention irrelevant details. One page resume for an intern is enough.
Tip 3 : Have projects related to the field which you are applying for, this shows you are already experienced in the field.
What people are saying about Deutsche Bank
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
The test started at 4 in the afternoon. It was online coding test from home only.
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...
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.
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
....
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
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.
Tip 1 : Practice as more as you can , I won't specify any number but be consistent.And
Tip 2 : Participate in short coding challenges .
Tip 3 : Do at least 2-3 good projects.
Tip 1 : Be confident of how to explain the things that you wrote in the resume . Do not put false stuff .
Tip 2 : Projects are a good highlight.
Deutsche Bank interview questions for designations
I was interviewed before Sep 2020.
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
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
.
T...
Find the largest palindrome number strictly less than a given palindrome number.
Iterate from the middle towards the start and end of the string to find the largest palindrome less than the given number.
If the number is odd in length, simply decrement the middle digit. If it is even, decrement the middle two digits.
Handle cases where the resulting number might have leading zeros by removing them.
Heaps are implemented using arrays with a binary tree structure.
Heaps are complete binary trees where each node has a value greater than or equal to its children in a max heap, or less than or equal to its children in a min heap.
The root of the heap is stored at index 0 in the array, and for any node at index i, its left child is at index 2i+1 and its right child is at index 2i+2.
Heap operations like insertion and dele...
Round duration - 45 minutes
Round difficulty - Easy
It took place at around 3:15 PM.
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) ...
Sort a stack in descending order using recursion without using loop constructs.
Implement a recursive function to sort the stack in descending order.
Use the provided stack operations to manipulate the stack.
Recursively pop elements from the original stack and insert them in the correct order in a temporary stack.
Once all elements are sorted in the temporary stack, move them back to the original stack.
Repeat the process ...
Round duration - 20 minutes
Round difficulty - Easy
HR round
took place in the evening at around 7:20 PM.
Tip 1 : Begin early, but do not regret your timing.
Tip 2 : Be consistent. Do something everyday. Small progress every single day is better than no a rushed, hard-work day and then nothing for a week
Tip 3 : Relax and don't stress. Never doubt even if you don't see progress or have to face rejection. Trust your timing.
Tip 1 : Include only genuine information.
Tip 2 : It should never be of more than one page
Get interview-ready with Top Deutsche Bank Interview Questions
I was interviewed before Sep 2020.
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.
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...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Recursively try moving in all directions (up, down, left, right) until reaching the destination.
Add the path to the result list when the destination is reached.
Sort the result list in alphabetical order before returning.
Find the number of ways the given number 'N' can be expressed as the sum of two or more consecutive natural numbers.
N = 9
2
Find the number of ways a given number can be expressed as the sum of two or more consecutive natural numbers.
Use a sliding window approach to iterate through consecutive numbers and check if their sum equals the given number.
Keep track of the count of valid consecutive sums found.
Return the count of valid consecutive sums as the final answer.
Tip 1 : Practice atleast 300 question.
Tip 2 : Resume should be of one page, if you are fresher.
Tip 3 : Don't lie on your resume.
Tip 1 : Keep it short and concise.
Tip 2 : Mention at least two good projects on your resume and know everything about those projects.
I was interviewed before Sep 2020.
Round duration - 30 minutes
Round difficulty - Easy
Your intro.
What is dynamic programming and how is it useful?
Balanced tree and its implementation by AVL, he did not specifically mention AVL.
Do you want to know something about me?
Saw my Snake Game Project.
Determine if a given Singly Linked List of integers contains a cycle.
A cycle in a linked list occurs when a node's next pointer points back to a pre...
Detect if a singly linked list contains a cycle using Floyd's Tortoise and Hare algorithm.
Use Floyd's Tortoise and Hare algorithm to detect cycle in a linked list
Initialize two pointers, slow and fast, and move them at different speeds
If there is a cycle, the two pointers will eventually meet
Time complexity: O(N), Space complexity: O(1)
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Implement a function to remove the Kth node from the end of a singly linked list.
Traverse the list to find the length 'N' of the linked list.
Calculate the position of the node to be removed from the beginning as 'N - K + 1'.
Traverse the list again and remove the node at the calculated position.
Round duration - 30 minutes
Round difficulty - Easy
It consisted of only HR questions. I fumbled but still managed to give answers to every question.
Round duration - 20 minutes
Round difficulty - Easy
Interviewer looked in a hurry
Tip 1 : Keep eye contact
Tip 2 : Maintain fluctuating tone so that, the interviewer shows interest in you
Tip 3 : Be confident with your answer
Tip 1 : Short and crisp
Tip 2 : Mention relevant and known details only
I applied via Campus Placement and was interviewed before Jul 2021. There were 4 interview rounds.
10 MCQs and 2 coding questions
I was interviewed before Mar 2016.
Behavioural and culture fit
Associate
4.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
3.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Vice President
3.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
2.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Financial Analyst
1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Barclays
JPMorgan Chase & Co.
HDFC Bank
ICICI Bank