Standard Chartered Software Developer Interview Questions, Process, and Tips

Q1. Explain Encapsulation
Ans. 
Encapsulation is the concept of bundling data and methods that operate on the data into a single unit.
• Encapsulation helps in hiding the internal state of an object and only exposing necessary functionalities.

• It allows for better control over the data by preventing direct access from outside the class.

• Encapsulation also helps in achieving data abstraction and information hiding.

• Example: In a class representing a car, th...read more
Answered by AI
Add your answer
Q2. How to call rest API
Ans. 
To call a REST API, you can use tools like Postman or code in languages like JavaScript or Python.
• Use tools like Postman to make HTTP requests to the API endpoints

• In programming languages like JavaScript, use libraries like Axios or Fetch to make API calls

• Include necessary headers, parameters, and authentication tokens in the request

• Handle the response data accordingly, whether it's JSON, XML, or other formats
Answered by AI
Add your answer

3 rounds of basic aptitude questions

Q1. Basic C, DSA, JAVA questions
Add your answer

Q1. Tell us about your projects, whats your interests are, then some technical questions in JAVA
Add your answer

Q1. Basic HR questions
Add your answer

Data structures and computer fundamentals

Q1. Data structures
Add your answer
Q2. Medium leetcode
Add your answer

You have to debug and correct the code given.

Q1. Fibonacci Series
Add your answer

1 Hour Basic Aptitude

2 Coding questions on Stacks and Array

Round duration - 90 minutes
Round difficulty - Easy

Q1. 
Occurrence of Each Word: Problem Statement
You are given a string S consisting of several words. Your task is to count the number of times each word appears in string S. A word is defined as a sequence of...read more
Ans. Brute Force
Steps:
 
• We iterate a given string, and while iterating the string, we maintain a temporary string word that stores the current word and then checks if we already count the word's occurrence previously by checking whether the word is present in the visited list.
• If the word is not present, then insert it in the visited list, and count the occurrences of the word in the rest of the string.
• Else, we simply sk...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
I did this question with the help of map.
I split the string on the basis of space and then counted the frequency of each word using map.
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Q1. 
Palindromic Substrings Problem Statement
Find the total number of palindromic substrings in a given string STR.
Example:
Input:
"abbc"
Output:
5
Explanation:
The palindromic substrings are: ["a", "...read more
Ans. Brute Force Approach
1. Initialize a count variable with 0 to keep track of the number of palindromic substrings.
2. Let n be the length of the input string. Run a double nested loop. The outer loop will go from i = 0 to i = n - 1, and the inner loop will go from j = i to j = n - 1. i and j denote the start and end indices of a substring in the input string.
3. Check whether the substring from index i to j forms a palindrome.
   • If it...read more
Answered Anonymously
Add your answer
Q2. How can you find the 4th highest salary from a table in a database?
Ans. 
Tip 1 : Do practice sql queries from leetcode.
Answered Anonymously
Add your answer

Round duration - 150 minutes
Round difficulty - Medium

For MCQ Round, we have 2 rounds:- 
1. Logical Reasoning (Window of 4 hours)
2. Mathematical Reasoning(Window of 4 hours)
The environment was fine. They gave an option of attempting a mock test in order to familiarize us with the environment

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, in my opinion, was the most challenging round. 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)
For the second question(60 Minutes)
The tricky thing was we only had one attempt, i.e we were allowed to submit the solution only once.

Q1. 
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. 
Step 1 : Make a Frequency array of size 26
Step 2 : Iterate on the string from left to right and increase the frequency of the character by one
Step 3 : Iterate on the Frequency array and find the max frequency and its corresponding character
Answered Anonymously
Add your answer
Q2. 
Mike and Mobile Problem Statement
Mike, a little boy who loves solving math problems, was playing with his mom's mobile phone. The mobile keypad includes 12 buttons: 10 digit buttons (0-9) and 2 non-digit...read more
Ans. 
Step 1 : We can solve this using recursion but it will be too slow
Step 2 : So to improve the complexity, we need to use memoization so that we will not recalculate the same step again and again
Step 3 : Recursion + Memoization = Dynamic Programming solution Passed all cases
Answered Anonymously
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

The timing was around 1 pm and the whole interview went for about 40 minutes.
The interviewer first went through my resume and asked me to introduce myself. After my introduction, he asked me about my projects mentioned in the resume. In the introduction itself, I told him that I am interested in competitive programming and preparing for ICPC. He then asked me about my preparation for ICPC. He then asked me some questions from OOPS. I was then asked 1 simple CP problem. The interviewer also asked about situation-based problems. As I previously mentioned about Competitive Programming, he asked how this will help in adding value to the company.

Q1. 
Remove Duplicates Problem Statement
You are given an array of integers. The task is to remove all duplicate elements and return the array while maintaining the order in which the elements were provided.
...read more
Ans. 
Step 1 : To mark the presence of an element size of the array, n is added to the index position arr[i] corresponding to array element arr[i].
Step 2 : Before adding n, check if the value at index arr[i] is greater than or equal to n or not. If it is greater than or equal to, then this means that element arr[i] is repeating.
Step 3 : To avoid printing repeating elements multiple times, check if it is the first repetition ...read more
Answered Anonymously
Add your answer

Round duration - 10 minutes
Round difficulty - Easy

In this round interviewer basically asked about my project in detail and also asked about various technologies used in that project.

Round duration - 10 minutes
Round difficulty - Easy

We were asked about family background, location of the intern, any interest in startups (as they don’t want students who they hire also work with startups side by side), etc.