Standard Chartered Software Analyst Interview Questions, Process, and Tips

Round duration - 170 minutes
Round difficulty - Easy

For MCQ Round, we have 2 rounds:- 
1. Logical Reasoning 
2. Mathematical Reasoning

Logical Reasoning, in which there were 12 questions, and for each question we had a time limit of 75 seconds. There was a cut-off of 40 for the next round, and people who qualified were sent an e-mail with a link to continue with the process.

Numerical Reasoning-The questions were in a pair of 3 in which a table/bank statement was given and 3 questions were based on that. The questions were purely based on calculations and semi-subjective. The time given for the 1st question was 90 seconds and for the rest 2 questions, 75 seconds each

For Coding Round, 
120 minutes window(Test was of 90 minutes)
We have two questions
For the first question(30 Minutes it can be solved 2 times)
For the second question(60 Minutes)

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
The task is to find all possible paths for a rat to navigate through a maze from start to finish.
• Create a recursive function to explore all possible paths from the starting position to the destination.

• Keep track of the current path and update it as the rat moves through the maze.

• Explore all possible directions (up, down, left, right) at each step, making sure to avoid blocked cells.

• When reaching the destination, add th...read more
Answered by AI
Add your answer
Q2. 
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...read more
Ans. 
The program finds the number that appears most frequently in an array of integers.
• Iterate through the array and keep track of the frequency of each number using a hashmap.

• Find the number with the maximum frequency and return it.

• If multiple numbers have the same maximum frequency, return the one that appears first in the array.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was an face to face round.There were 2 interviewers and they asked me coding question and some puzzles and some questions related to my project which was mentioned in my resume.

Q1. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
Calculate the Nth Fibonacci number efficiently using recursion or dynamic programming.
• Use recursion with memoization to avoid redundant calculations.

• Implement dynamic programming to store and reuse previously calculated Fibonacci numbers.

• Optimize space complexity by only storing the last two Fibonacci numbers instead of the entire sequence.
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 determine the total number of ways to make change for a specified value using given denominations.
• Create a dynamic programming table to store the number of ways to make change for each value up to the specified value.

• Iterate through each denomination and update the table accordingly.

• The final answer will be the value in the table at the specified value.

• Consider edge cases such as when the specified value...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was basically a resume round Interviewer went through my resume throughly and asked me about the things mentioned in my resume.

Round duration - 15 minutes
Round difficulty - Easy

It was a simple hr round and he asked me basic questions