Deutsche Bank Interview Questions, Process, and Tips

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.

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given Singly Linked List of integers contains a cycle.
Explanation:
A cycle in a linked list occurs when a node's next pointer points back to a pre...read more
Ans. 
First I told the interviewer, hashing approach to detect cycle then I moved to optimised solution that was through two pointers concept. The interviewer was satisfied with my approach.
Answered Anonymously
Add your answer
Q2. 
Remove the Kth Node from the End of a Linked List
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...read more
Ans. Using Lists
The naive solution is to process all the nodes from the front side of the linked list and keep adding a node to the list. Now we can easily remove the Kth node from the end of the list by simply replacing the next pointer of the ('LENGTH' - 'K' - 1)th node (0-based indexing from start) of the list with the ('LENGTH' - 'K' + 1)th node. This way we can remove the Kth node from the end of the linked list.
Space ...read more
Answered Anonymously
Add your answer

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