Recently, Deutsche Bank visited our campus to recruit Interns and FTEs and I got the offer. I am sharing my whole interview experience. There were total 5 rounds:
- Online Assessment
- Technical Round 1
- Technical Round 2
- Pro-Fitness Round
- HR Round
Online Assessment Round was conducted on 13th Aug, 2023 and all the interviews were conducted on 17th Aug, 2023.
Online Assessment :
Platform: HackerEarth Time: 90mins (3 coding problems)
- Validate an IP Address [Medium]
- Collecting Coins [Easy] (Greedy based): In a battle royale game, N heroes (with powers in array A) face M monsters (with powers in array B). A hero can defeat a monster if their power is greater or equal. After a victory, the hero earns coins from array C (of size M). We want to find how many coins each hero can collect by defeating any monster.
- N = 5, M = 4
- A = [1, 3, 5, 2, 4]
- B = [1, 4, 2, 9]
- C = [1, 2, 8, 4]
Output: 11
- Largest Dividing K [Hard]: Given an integer array of size N and an integer K. Find the largest positive number, less than or equal to 10^9, such that at least K numbers in the array are divisible by it.
- N = 5, K = 3
- nums = [12, 16, 32, 2, 45]
Output: 4
Technical Round 1 :
Time: 45-50mins
The person who took my Interview was the CTO of the company. He was very friendly and started with my intro. Then asked about my last project in the Hackathon. What was the USP of your product? How was it different from others in that hackathon and later told me to draw the HLD of the project and asked actually what was happening behind the scenes — Authentication, Forgot Password Implementations etc. Then he directly jumped to the Architecture of Git.
He asked me very basic DSA questions like — the Middle of the LinkedList and some real-life examples of data structures — BST, Stack, LinkedList etc. Some differences between Array & LinkedList based on the use cases, when LinkedList should be preferable to Array?
Apart from these, he asked some basic questions — What is OOP? Mention the pillars. What are the differences between SQL & NoSQL? Dynamic Schema, CAP Theorem, ACID Properties.
At the end he offered to ask any question. I heard DB was in migration from On-Prem services to Google Cloud Platform (GCP), so I asked about these and he was very interested & started discussion for 5-6 mins more.
Technical Round 2 :
Time: 65-70mins
The interviewer was not so friendly. He started with my intro and asked me about my projects. He asked me: “You know Git! Write down the Git commands from cloning to pushing-merging”. Wanted to know about the staging changes. Some project-related discussions…
In DBMS, he asked me what I think which will be faster between SQL and MongoDB. I answered it with different scenarios. Then he told me to create a table in SQL, define schemas, insert elements & some basic SQL queries related to that table.
He asked what are the data structures I know. Some real-life examples of the data structures. Then some very basic DSA questions —
- You have an array of 100 elements where every element is present 1 time except an element that is present twice. Find the duplicate element.
- Create a stack
- Fibonacci, where you can apply Fibonacci in real-life
Though we were running out of time, he gave me two puzzles —
- You have X rupees and Y paisa in your bank. You go to the bank and withdraw all money. At the time of withdrawing, the Bank mistakenly gave you Y rupees, X paisa. Now, if you subtract 5 paise from your withdrawn money, the resultant money will be twice your actual Bank Money. What was the money present in your Bank?
After formulating, I asked “May I use a calculator?” He gave no response. I started taking x = 1, 2, 3 on the rough page but was unable to find (X, Y) there. [ Ans: (31, 63) ]
Pro-Fitness Round :
Time: 50mins
The interviewer was very friendly and asked to show my projects in his Mobile. I have Srijan23 project so just tell him to search “Srijan JU” in Google and it will appear :’) Then, I displayed different sections of the project on my mobile fast. He asked me what is the “Resume” written in your Resume. I actually built my Resume using HTML/CSS & hosted it in Amazon S3 & used CloudFront for more optimized distribution so told him about that.
Then, he asked about SRIJAN (the Annual Techno-Management Fest of Jadavpur University) — what’s happening there, what are the events, students from all departments are there to organize events? Merchandises!!
What were your difficulties at the time of making and managing this website, what were the challenges? He asked me, if you get some funds then what are the tech stacks you decide to choose and why? What are the things you want to add more to this website? A large amount of people were accessing this website so what kind of steps you took at that time?
Then asked some behavioral questions. He also asked about my family background and any plan for Higher Study. At the end, he gave me a chance to ask some questions.
HR Round :
Time: 15-20mins
This event was organised in Microsoft Teams. A female HR was there on the other side. She asked me to tell her about myself. She asked me about my hobbies and my favorite games (PC, Mobile games). She was very frank and then asked some situation-based questions. Example —
- What is your experience after joining JU?
- If you see that there is a deadline of tomorrow, and today in the evening you found a critical bug. What will you do?
- Why DB?
Final Verdict: SELECTED !!!
Tips:
- Study implementations of all Data Structures with real-life examples & analysis of all sorting algorithms
- Have some good projects (try to keep some Full Stack projects) in your resume and have a clear understanding of that
- They are very much focused on Teamwork, not only on individual skills. So try to showcase this skill
- Be confident with your answers
- If you are given some hard questions, don’t panic, just try to tackle with your basics. They also know that is a hard question, if you can try and solve it a little bit, they become very happy and give good feedback
- Try to collect some news about the Company and prepare some questions beforehand to ask in each round