Standard Chartered 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

Round duration - 90 minutes
Round difficulty - Medium

Coding round, two Questions: one easy and one hard
The test was scheduled for 6 pm.

Q1. 
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...read more
Ans. 
Find the second largest element in an array of integers.
• Iterate through the array to find the largest and second largest elements.

• Handle cases where all elements are identical.

• Return -1 if a second largest element does not exist.
Answered by AI
Add your answer
Q2. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to find the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the number of ways to make change for each value using different denominations.

• Iterate through the denominations and values to fill up the array.

• The final answer will be in the last cell of the array.

• Handle base cases such as whe...read more
Answered by AI
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 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. 
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
• Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes.

• Use a priority queue to efficiently select the next node to visit based on the shortest distance.

• Update the shortest distance to each node as you explore the graph, considering the edge weigh...read more
Answered by AI
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.