Skip to content
Related Articles
Open in App
Not now

Related Articles

Deutsche Bank Interview Experience | Set 6 (On-Campus)

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 03 Dec, 2017
Improve Article
Save Article

Deutsche Bank visited the campus and coding round included 10 MCQs based on Sorting and Data Structures.
2 coding questions:
1. String is given and left and right integer is given. Left means number of character to be rotated left, and right means number of characters to be rotated right. Find the resultant string.
Solution: O(1) possible. Take the difference of left and right. Extract the sub strings, and concatenate them accordingly.
2. Queries problem. Repetitive updation of the array.
Solution: Lazy propagation.

Round 1:

It was technical as well as HR round. 2 people in the panel. Some of the questions asked were:

  1. Tell me about yourself. He kept questioning you on whatever you speak, and kept noting down your answers.
  2. Why Deutsche Bank?
  3. Does money attract you? Have you done trading sometime?
  4. What are your hobbies?
  5. Suppose, you are in a team of 4 people. 2 of them has solution A, you and the fourth person has solution B. Solution B is more robust for the future. But people with Solution A is at higher position than you. How will you convince them?
  6. Have you taken part in any online coding contest? What was your rank?
  7. Egg Dropping puzzle (x eggs and k floors).
  8. Array consists of 0 and 1, sort it efficiently.
  9. Questions on inheritance, polymorphism, base class, derived class.
  10. Do you want to ask any question?

Round 2:

It was around 1 hr 30 mins long interview. There were 2 people in the panel. They kept on asking questions back to back.

  1. Explain your internship project. Since, I had project on DBMS, he asked many questions on DBMS.
  2. Write SQL for 3-4 questions.
  3. Difference between WHERE and HAVING? Where do we use them?
  4. Explain insertion and deletion in array and linked list.
  5. Five differences between tree and graph.
  6. Explain Bellman Ford Algorithm and how is this different from Dijkstra?
  7. Traveling salesman problem, and what if he need not return back to his home?
  8. Which sorting algorithm is the best according to you, Merge sort or quick sort?
  9. Explain Heap Sort.
  10. Explain Memory management.
  11. Explain Mutex and Semaphore.
  12.  Do you want to ask any question?

Round 3:

It was HR round. 4 people in the panel.

  1. How was your day?
  2. How many interviews have you given till now?
  3. How many are still left?
  4. Describe yourself in exactly 3 lines.
  5. What will you choose between Amazon and Deutsche Bank?
  6. Would you like to go abroad?
  7. What will you prefer, Bangalore or Pune?
  8. What will you prefer, working as a teammate or being the leader of the team?
  9. Do you have anything to ask?

Thanks to GeeksForGeeks for helping an electrical student cracking CS interviews. 🙂

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!