Deutsche Bank recently visited our campus for recruitment of FTE as well as an internship. The whole process consisted of 1 coding round, 2 tech round, 1 profit round, and 1HR round.

**Coding Round: **The coding round had 3 questions which should be solved in 1.5 hr.

- **Question 1: **It was a string manipulation question. Suppose input was string1, string2, and k seconds. We have to choose every i form 1 to k and shift a character from the string by i index (eg: if i=3 then ‘a’ would be shifted to ‘d’). Each i could be chosen only once. We need to check if we can convert string1 to string2. (20 marks)

```
Input:
k=3
string1 = 'abc'
string2 = 'ddd'
Output:
Yes
```

**Question 2:**Suppose at the first level of a tree a root node is always present. You are given an array count where count[i] denotes the number of nodes present at the ith level. We need to output the maximum diameter(number of edges in the longest path) possible for this tree. (50 marks)

```
Input:
cnt[]={2}
Output:
2
```

**Question 3:**A segment tree question. (50 marks)

15 students were selected for the interview. Most of the students selected for the interview had either solved all 3 questions or had good CPI and had solved 1.5/2 questions.

**Technical Round 1: **Initially, the interviewer asked me to introduce myself. He further asked what was my favorite data structure and algorithm to which I said heap and sorting. He asked me to list a few applications of the heap and what data structure I would use to store heap (ans: array for binary heap). Further, he asked me to explain the heap sort algorithm. Also, I was given an array, and he asked me to insert elements to a min-heap and show him the final structure formed. The coding questions asked me after this was:

- Kadane’s Algorithm
- Dutch National Flag Algorithm
- Queue using two stacks and for a follow-up, question queue using a single stack.
- Find a loop in the linked list
- Stack using linked list
- InOrder, PostOrder, PreOrder Traversal of tree
- What is a binary search tree and perform deletion in a binary search tree.
- Bubble Sort Algorithm (along with its best, average and worst-case time complexity)
- He also asked me the time complexity for most of the questions.
- He asked me to explain the main difference between paging and segmentation, the difference between OSI model and TCP/IP model. Most of the basic concepts were covered by him.

Out of 15 students, 10 were selected for the next round.

**Technical Round 2: **The person who took my second interview was the VC(FX Settlements Technologist) of Deutsche Bank. He was quite friendly and nice.

He asked me to introduce myself. Further, he had a look at my resume and asked me about a DBMS project that I had mentioned. I explained to him the entire project and also my contribution to it. Based on my explanation he asked me to write 2 queries. Then he asked to explain about the project of my last internship. Since it was based on cryptography and involved a lot of math he asked 2 math-based puzzles.

- **Puzzle 1: **Suppose there is a closed dark room and there are 5 hats in the room. 2 are red and 3 are blue. 3 women enter the room pick up any random hat wear it and come out. 2 women cannot see their own hat, but they can see the other women’s hat and the 3rd woman is blind. 2 women say that they cannot judge which colour hat they are wearing. The third woman after hearing this replies she exactly knows what colour hat she is wearing. We need to find what was the colour of the hat of the third women. (ans: blue)
- **Puzzle 2: **The 3 & 5 Litre Die Hard Water Puzzle

He further asked me my favorite subject to which I replied DSA.

He asked me to find the number of times a given character occurs in a string and also the index. The twist here was to include any of the oops concepts in the implementation. (I used inheritance)

He also asked me a situational question. If I were leading a project and my best friend who is a part of the team stopped working for it, and we had a deadline of 1 month to complete the project, how would I handle the whole situation?

Out of 10 students, 8 were selected for the next round.

#interview experiences #deutsche bank #marketing #on-campus

9.40 GEEK