Deutsche Bank Interview Questions, Process, and Tips

3 questions - DFS, Greedy and Priority Queue

Q1. Implement max heap, basically how priority queue is implemented
Ans. 
Max heap is a data structure where the parent node is always greater than or equal to its child nodes.
• Start by creating an array to store the elements of the max heap.

• Insert elements into the array and maintain the heap property by swapping elements if necessary.

• Implement functions like insert, extractMax, and heapify to maintain the max heap structure.

• Example: If we have elements 10, 7, 15, 3, 8, the max heap would be
Answered by AI
Add your answer
Q2. Question on my projects and DBMS
Add your answer

Q1. Find second largest number in an array.
Ans. 
Find the second largest number in an array of strings.
• Convert the array of strings to an array of integers.

• Sort the array in descending order.

• Return the second element in the sorted array.
Answered by AI
Add your answer
Q2. Find missing number
Add your answer

Q1. General HR questions
Add your answer
Q2. My future goals
Add your answer

Q1. I am a deta auntry opretor
Add your answer
Q2. My name is Amit naskar
Add your answer
Q3. My father name is Kamal naskar
Add your answer
Q4. My city is kalkata
Add your answer
Q5. I am a deta auntry oppretar
Add your answer

Leetcode easy to medium questions

Q1. Different types of sorting algorithms
Ans. 
Sorting algorithms are methods used to arrange elements in a list in a specific order.
• Bubble Sort - compares adjacent elements and swaps them if they are in the wrong order

• Merge Sort - divides the list into smaller sublists, sorts them, and then merges them back together

• Quick Sort - selects a 'pivot' element and partitions the list into two sublists around the pivot

• Insertion Sort - builds the final sorted list one elem...read more
Answered by AI
Add your answer
Q2. Question of increasing subsequence
Add your answer
Q3. Data Structure and Algorithms, OOPs , Operating System and DBMS questions
Add your answer

Q1. 2nd highest Salary SQL question
Add your answer
Q2. Project related questions
Add your answer
Q3. SQL ,DBMS questions
Add your answer

Q1. Why you want to join this company?
Add your answer
Q2. What are your positive and negative qualities?
Add your answer

Probability test with some questions involved

Q1. What languages do i know
Ans. 
I am fluent in English, Spanish, and French.
• English

• Spanish

• French
Answered by AI
Add your answer
Q2. How to do bfs
Ans. 
BFS (Breadth-First Search) is a graph traversal algorithm that explores all the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
• Start by visiting the starting node and enqueue it.

• While the queue is not empty, dequeue a node and visit its neighbors.

• Enqueue the neighbors of the visited node and mark them as visited to avoid revisiting.

• Continue this process until all nodes are v
Answered by AI
Add your answer