SDE - Intern
Deutsche Bank
3 rounds | 10 Coding problems
912 views
Interview preparation journey
Preparation
Duration: 2 months
Topics: OOPS from geeksforgeeks articles; Data Structures, Dynamic Programming, Algorithms from variuos coding platforms including leetcode and geeksforgeeks; Database Management System from youtube (channel Gate Smashers), Operating System from youtube (channel Gate Smashers) and geeksforgeeks
Tip

Tip 1 : Begin early, but do not regret your timing.
Tip 2 : Be consistent. Do something everyday. Small progress every single day is better than no a rushed, hard-work day and then nothing for a week
Tip 3 : Relax and don't stress. Never doubt even if you don't see progress or have to face rejection. Trust your timing.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

Tip 1 : Include only genuine information.
Tip 2 : It should never be of more than one page

Interview rounds
01
Round
Easy
Online Coding Interview
Duration40 minutes
Interview date11 Aug 2020
Problems4
Next smaller Palindrome

#### You are given a number 'N' in the form of a string 'S', which is a palindrome. You need to find the greatest number strictly less than 'N' which is also a palindrome.

##### Note:
view more
Explain how heaps are implemented

Explain how heaps are implemented

Problem approach

Step 1: Heaps require the property of sorting themselves such that the smallest or largest element is at the top. So we need something that can sort itself in reasonable time complexity every-time a new element is added or deleted. A good way to get that is a binary search tree which can do this in O(log n).

Diamond Problem

Diamond problem is when more than one class inherits a class and one class inherits those classes. Ex. Classes B and C inherit class A, and class D inherits classes B and C. If B and C have the same function and class D calls that function, then there will be an error as the compiler won't know which class's function to call.

Problem approach

Either use scope-resolution operator or virtual functions

What are destructors
Problem approach

A destructor is a member function that is invoked automatically when the object goes out of scope or is explicitly destroyed by a call to delete . A destructor has the same name as the class, preceded by a tilde ( ~ ). For example, the destructor for class String is declared: ~String()

02
Round
Easy
Online Coding Interview
Duration45 minutes
Interview date11 Aug 2020
Problems2
Sort a stack

#### We can only use the following functions on this stack S.

view more
Problem approach

Sorted it using recursion, wherein the current element (top) is taken out and the function called by recursion to sort the remaining stack. Then the element is inserted in its right place.

What modules did you use in your project
Problem approach

Tip 2 : Abide by organisation norms while making a system

03
Round
Easy
Online Coding Interview
Duration20 minutes
Interview date11 Aug 2020
Problems4
How to work when you do not feel like it
Problem approach

Tip 1 : Be goal-oriented and see yourself at the finish-line, at the point when you have already completed the job.

Any situation where you showed problem-solving along with team skills.
Problem approach

Why do you want to join this company
Problem approach

Where do you see yourself 5 years down the line
Problem approach

Tip 1 : As a self-sufficient, independent person who has grown personally and professionally.

Start a Discussion
Similar interview experiences
Software Developer
3 rounds | 5 problems
Interviewed by Deutsche Bank
4457 views
Technical Analyst-Intern
5 rounds | 15 problems
Interviewed by Deutsche Bank
460 views
SDE - Intern
4 rounds | 2 problems
Interviewed by Deutsche Bank
235 views
Analyst - Intern
3 rounds | 3 problems
Interviewed by Deutsche Bank
273 views
Companies with similar interview experiencs
SDE - Intern
2 rounds | 3 problems
Interviewed by Trilogy Innovations
16793 views