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

The test started at 4 in the afternoon. It was online coding test from home only.

Q1. 
Query and Matrix Problem Statement
You are given a binary matrix with 'M' rows and 'N' columns, initially consisting of all 0s. You will receive 'Q' queries, which can be of four types:
Query 1: 1 R inde...read more
Add your answer
Q2. 
Jump Game Problem Statement
In this problem, you are given an array ARR consisting of N integers. Your task is to determine the minimum number of jumps required to reach the last index of the array N - 1....read more
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

Timing was 11 a.m. approximately. It was an online technical round.

Round duration - 30 Minutes
Round difficulty - Medium

This was the ProFit(Professional Fitment) Round to check if we are suitable for their company and if we find their company suitable for ourselves.
Timing was around p.m.

Round duration - 10 Minutes
Round difficulty - Easy

Timing was around 9 p.m.

Round duration - 90 minutes
Round difficulty - Medium

Timing - Late in the evening(7pm - 8 pm)
Virtual round, can give from home. 
Had to keep webcam on during the test. 
Tab switching was not allowed, and activity was monitored.

Round duration - 20 minutes
Round difficulty - Medium

Round in the morning, with 2 interviewers.
Questions based on Resume.

Q1. 
Longest Subarray Zero Sum Problem Statement
Given an array of integers arr, determine the length of the longest contiguous subarray that sums to zero.
Input:
N (an integer, the length of the array)
arr (...read more
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

In the afternoon, with 3 recruiters, 2 HRs and 1 project manager.

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 Problem Statement
You are given an n×n chessboard where rows and columns are numbered from 0 to n-1. Each cell (r, c) is located at the intersection of row 'r' and column 'c'. A rook is a ch...read more
Add your answer

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.

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. Why do you want to join this company, and can you tell me about your projects?
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.

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 Problem
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...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 Anonymously
Add your 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.