DBS Bank Software Developer Intern Interview Questions and Answers

Standard Aptitude test

Medium level question on graphs

Q1. Matrix least sum path (dp)
Add your answer
Q2. Medium level question on Linked List
Add your answer

3 DSA questions were asked

The questiona all are from aptitude

Some technical medium range questions asked

Q1. Main questions are from data structure
Add your answer
Q2. Some questions are from java
Add your answer
Q3. Some personal questions
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

There were around 10 MCQS and 2 coding questions.  The MCQs mainly had questions related to DBMS and OOPs. There were also questions related to error debugging and give the output of a segment of code. Questions in DBMS were related to SQL commands. The test duration was from 5:30 to 7 pm. There were 2 questions in the coding round. The first one was based on a matrix and the second was based on dynamic programming.

Q1. Matrix Flip Bit
You have been given a binary matrix ‘MAT’ of size ‘N’ * ’N’. Let ‘i’, ’j’ denote the row and column of the matrix, respectively. If ‘MAT’[i][j] is equal to 0, flip every 1 in the ‘i’th row ...read more
Ans. 
I first applied brute force but the solution was exceeding the time limit so I looked for ways to avoid traversing every
row and column of the matrix. Take the input of the matrix and in a map stored the location of every 0 in the original matrix. Then I traversed through the matrix whenever I encountered a 0 I traversed through its row and column and counted the number of ones. I also marked the row and column visited ...read more
Answered by CodingNinjas
View 3 more answers
Q2. Jump Game
You have been given an array 'ARR' of ‘N’ integers. You have to find the minimum number of jumps needed to reach the last index of the array i.e ‘N - 1’ if at any index ‘i’ we can jump to...read more
Ans. Brute Force Approach
• For each index, we find all possible locations we can jump to i.e if we are currently at an index ’i’ and ‘ARR[i]’ = k then we recursively find the answer for all indices from i + 1 to i + k and take the minimum of the answer and add 1 to it to find the minimum number of jumps to reach index last index from index ‘i’.
• For example, Consider the array : 2, 3, 1, 4
• We will have the following recursion tr...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 45 minutes
Round difficulty - Easy

It was an interview round that took place over skype and it lasted for about 45 minutes. My interviewer was polite and gave me time to think for a few answers and was patient when there were technical difficulties. I was also asked to share my screen and show the working code for a few of the questions asked in the interview. I used an online compiler to do so (onlinegdb). Overall the interview went pretty decent with a mix of easy and tough questions.

Q1. SQL Query
I was asked to write a query to select all the people who are below the age of 75 from a set of people.
Add your answer
Q2. OOPS
What is the diamond problem?
Ans. 
The diamond problem occurs when two superclasses of a class have a common base class. For example, in the following diagram, the TA class gets two copies of all attributes of Person class, this causes ambiguities.
Answered by CodingNinjas
Add your answer
Q3. Dijkstra's shortest path
You have been given an undirected graph of ‘V’ vertices (labeled 0,1,..., V-1) and ‘E’ edges. Each edge connecting two nodes (‘X’,’Y’) will have a weight denoting the distance betw...read more
Ans. 
I followed the same steps as given by the algorithm and also showed the output using some test cases.
Answered by CodingNinjas
View 2 more answers
Q4. Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge sor...read more
Ans. 
I had gone through the topic of time complexities really well before the interview. Whenever you practice coding do look at the time complexities of various standard problems like merge sort or bubble sort and also know all the possible ways to do them. Do all the standard coding problems and know their optimized solutions under every topic. Make sure you know your projects thoroughly. Be confident and don't beat aroun
Answered by CodingNinjas
View 2 more answers

Round duration - 30 minutes
Round difficulty - Easy

This was a professional fitness round. It lasted for about 20-30 minutes. I was asked general questions about my future and career and the interviewer wanted to know what kind of a person I am and if I am fit for working in their company.

Q1. HR Questions
First I was asked to introduce myself wherein I spoke about my hometown and my earlier education and also included my hobbies. Then I was asked why I wanted to work in that particular company t...read more
Ans. 
Tip 1 : Be confident
Tip 2 : Know everything there is to know about the company
Tip 3 : Know about the recent technologies that are being adopted by various companies
Tip 4 : Have answers prepared for questions like "What are your future plans" and "why do you want to work here?"
Tip 5 : Know where your interests lie in the technical field. 
Answered by CodingNinjas
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

This round was an HR round. Here I wasn't asked anything related to tech. Very general questions were asked and the purpose of this round was mainly to know if I had an aadhar card or had Indian citizenship or not or if have anyone related to me who was working in that company. Everyone who made it to this round was selected, this round wasn't to test your abilities but just to know if you can work in DB in India.

Q1. HR Questions
I was asked to introduce myself and about my hobbies and hometown. They were very general questions. It was a fun and relaxed round.
Ans. 
Tip 1 : When the interviewer asks you "How are you?" respond and ask them the same question
Tip 2 : Be polite and confident
Answered by CodingNinjas
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was first entrance round which was conducted in online mode. It had 2 coding question and 10 mcqs.it was around 90 min in total and took place in evening at around 5 pm. 

Q1. Rooks Placing
You are given an n×n chessboard. Rows and columns of the board are numbered from 0 to ‘n’-1. Cell (r,c) lies at the intersection of row number 'r' and column number ‘c’.
Rook is a c...read more
Ans. 
my solution was similar to this

var allSolutions = _.memoize(function(n) {

if (!n) return [];

if (n === 1) return [[[true]]];
var solutions = [];

for (var i = 0; i < n; i++) {

_.each(allSolutions(n-1), function(nMinusOneSolution){

solutions.push(generateSolution(nMinusOneSolution, i));

});

}

return solutions;

});



var generateSolution = function(nMinusOneSolution, i) {

var n = nMinusOneSolution.length + 1;

var newSet = [];

for (var...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 40 minutes
Round difficulty - Medium

It was the first interview round conducted on skype. Each of the candidates were provided with the name of the interviewer and time slot in advance, and were expected to join to the link provided . The interviewer was really sincere and asked question straight to the point and asked me to write 2 3 codes for which he gave me questions and asked me to share my screen.

Q1. Puzzle
Alok has three daughters. His friend Shyam wants to know the ages of his daughters. Alok gives him first hint.
1) The product of their ages is 72.
 
Shyam says this is not enough information Alok ...read more
Ans. 
Tip 1 : Be calm think properly and answer
Tip 2 : Share your approaches continuously
Tip 3 : Even if you cannot get the final answer share your approach.
 
Answered by CodingNinjas
Add your answer
Q2. OOPS questions
What is virtual class, abstract class and other concepts?
Ans. 
Tip 1 : Go through oops properly
Tip 2 : Concentrate on basics
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

it was a technical and hr round .he asked me about my projects ,discussed my resume and questioned my skills and projects . He asked me why I wanted to join this company. Here also we were told about the result of previous round, interviewer and time slot in advance.

Q1. General Questions
Why do you want to join this company? Tell m about your projects
Ans. 
Tip 1 : be honest
Tip 2 : just say what you feel
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

He discussed my project and what all changes I would like to implement in near future and about resources and references We were given time slot and name of interviewer in advance.

Q1. General Questions
Questions related to my project and what all fields I have interest in
How will I manage a team if needed?
Ans. 
Tip 1 : be calm smile be confident
Tip 2 : think of the interviewer as a person you can be honest with and maintain a positive environment if you feel nervous tell him/her that you are nervous they will definitely support you.
Answered by CodingNinjas
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

This video call interview round was fairly based on the Resume. The interviewer went in detail about a couple of projects related to ML and Djikstra algorithm. The questions asked were very basic; based on the technology stack I used and why did I really choose it. He also asked me to present my screen and show the code I wrote for the project.

Q1. Dijkstra's shortest path
You have been given an undirected graph of ‘V’ vertices (labeled 0,1,..., V-1) and ‘E’ edges. Each edge connecting two nodes (‘X’,’Y’) will have a weight denoting the distance betw...read more
Ans. Using Adjacency Matrix
The idea is to maintain two arrays, one stores the visited nodes, and the other array stores the distance (element at index ‘i’ denotes the distance from node 0 to node ‘i’). We pick an unvisited minimum distance vertex, then update the distance of all its adjacent vertices considering the path from source to an adjacent vertex to pass through the picked minimum distance vertex. Repeat the process...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 10 Minutes
Round difficulty - Easy

This was a typical round by HR. There were only 5 students shortlisted for this round so it wasn't an eliminator round. The straight strategy followed by HR was to understand why I have shifted to the IT field from Civil engineering and how keen I am to continue in this field and not exit later.

Q1. Basic HR Questions
Who is your role model?
What are your hobbies?
Add your answer