Standard Chartered interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Standard Chartered
upvote
share-icon
3 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Journey
I prepared for the SDE-1 role by focusing on DSA, Java, Spring Boot, and SQL, aligned with industry expectations for 2+ years of experience. I practiced coding problems regularly, built small Spring Boot projects, and worked on efficient SQL queries. I appeared for interviews with multiple companies and faced some rejections, but consistent practice and improving from feedback helped me stay focused. Finally, I got my offer at Standard Chartered Bank, Bangalore.
Application story
I was referred by an employee of SCB and received a call from the SCB recruiter for some other openings after around 50 days of the referral. Afterwards, the process was really quick.
Why selected/rejected for the role?
I was selected because of my strong problem-solving skills, solid knowledge of data structures and algorithms, and the ability to apply them effectively in real-world scenarios. My project work and clear communication during interviews also showcased my adaptability and teamwork, which matched well with SCB’s requirements for the SDE role.
Preparation
Duration: 8 months
Topics: Recursion, Dynamic Programming, Trees, Graphs, Linked List, Stack, Queue, Sliding Window, Two Pointer Technique, Heap (Min Heap, Max Heap), Java Basics (OOP Concepts, Collections Framework, Multithreading & Concurrency), Spring Boot Framework Fundamentals
Tip
Tip

Tip 1: Practice DSA regularly.
Tip 2: Learn Java and Spring Boot fundamentals along with SQL.
Tip 3: Reach out to people on LinkedIn for referrals.

Application process
Where: Referral
Eligibility: 1-3 years of experience, (Salary Package: 12 LPA)
Resume Tip
Resume tip

Tip 1: Include only job-relTip 1: Highlight relevant skills, experience, and achievements, emphasizing impact with measurable results wherever possible (e.g., improved system performance by 30%, reduced query time by 50%).
Tip 2: Make your resume ATS-friendly by using clear headings, standard fonts, and keywords from the job description.

Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date25 Jun 2025
Coding problem2

2 coding questions were there, one from Stack and the other was an greedy algorithm based question. I attempted the test at late night.

1. Valid String

Moderate
18m average time
85% success
0/80
Asked in companies
VisaAmazonArcesium

You have been given a string 'S' containing only three types of characters, i.e. '(', ')' and '*'.

A Valid String is defined as follows:

1. Any left parenthesis '(' must have a corresponding right parenthesis ')'.
2. Any right parenthesis ')' must have a corresponding left parenthesis '('.
3. Left parenthesis '(' must go before the corresponding right parenthesis ')'.
4. '*' could be treated as a single right parenthesis ')' or a single left parenthesis '(' or an empty string.
5. An empty string is also valid.

Your task is to find out whether the given string is a Valid String or not.

Problem approach

Tip 1: Practice classic stack problems (Balanced Parentheses, Next Greater Element, Stock Span, etc.).
Tip 2: Learn common patterns like Monotonic Stack, Backtracking with Stack, Expression Evaluation.
Tip 3: Always do a step-by-step dry run to understand stack push-pop behaviour clearly.

Try solving now

2. Counting Triangle Triplets

Easy
0/40
Asked in company
Standard Chartered

You are given an integer array nums representing possible side lengths. Your task is to count the number of unique triplets (i, j, k) with i < j < k that can be chosen from the array to form the sides of a valid triangle.


A triangle is considered valid if the sum of the lengths of any two sides is strictly greater than the length of the third side.


Problem approach

Tip 1: Practice key greedy algorithm problems (like Activity Selection, Fractional Knapsack) to understand common patterns.
Tip 2: Identify if the problem has the greedy-choice property and optimal substructure before attempting a greedy solution.
Tip 3: Compare with dynamic programming approach when in doubt - greedy works only if local decisions are always globally optimal.

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date1 Jul 2025
Coding problem2

Two DSA questions were there, first one was based on Dynamic programming and the second was based on string matching algorithm.

1. Find Minimum Number Of Coins

Easy
15m average time
85% success
0/40
Asked in companies
Goldman SachsMicrosoftAmazon

Given an infinite supply of Indian currency i.e. [1, 2, 5, 10, 20, 50, 100, 500, 1000] valued coins and an amount 'N'.


Find the minimum coins needed to make the sum equal to 'N'. You have to return the list containing the value of coins required in decreasing order.


For Example
For Amount = 70, the minimum number of coins required is 2 i.e an Rs. 50 coin and a Rs. 20 coin.
Note
It is always possible to find the minimum number of coins for the given amount. So, the answer will always exist.
Problem approach

Tip 1: Start with recursion followed by memorization and finally tabulation for a solid understanding.
Tip 2: Learn common DP patterns (0/1 Knapsack, Longest Increasing Subsequence, Matrix Chain Multiplication, etc.).
Tip 3: Practice breaking problems into overlapping subproblems and state definitions to design your DP solution effectively.

Try solving now

2. Prefix Word Finder

Easy
0/40
Asked in company
Standard Chartered

You are given a string sentence containing words separated by single spaces, and a string searchWord.

Your task is to find the first word in the sentence that has searchWord as a prefix. Return the 1-indexed position of this word.


If searchWord is a prefix of multiple words, you must return the index of the first such word. If no word in the sentence has searchWord as a prefix, return -1.


Problem approach

Tip 1: Learn key algorithms like KMP, Rabin-Karp, Z Algorithm, and Naïve Approach.
Tip 2: Learn to identify string matching patterns (exact match, substring search, pattern with wildcards).
Tip 3: Practice problems involving substring search, pattern matching, and string pre-processing techniques.

Try solving now
03
Round
Easy
Video Call
Duration60 minutes
Interview date4 Jul 2025
Coding problem4

In this round I was asked questions based on Java Basics, Spring Boot Fundamentals and SQL.

1. Java Fundamentals

  • Object-Oriented Programming (OOP) concepts. (Learn)
  • Stream API usage. (Learn)
  • Debugging scenarios. (Learn)
  • Designing custom exceptions. (Learn)
  • Understanding the garbage collection process. (Learn)
Problem approach

Tip 1: Focus on OOP principles and how they apply in real-world scenarios.
Tip 2: Implement small programs using Streams, exceptions, and custom logic to strengthen understanding.
Tip 3: Basics of garbage collection, memory management, and object lifecycle to handle conceptual questions confidently.

2. Java Multithreading

  • Producer-Consumer problem. (Learn)
  • Thread coordination methods: wait(), notify(), notifyAll(). (Learn)
  • Thread control methods: sleep(), yield(), etc. (Learn)
Problem approach

Tip 1: Understand core thread concepts i.e. Threads, synchronization, race conditions, and critical sections.
Tip 2: Implement Producer-Consumer, Reader-Writer, and other concurrency patterns to understand coordination.
Tip 3: Know thread control methods like wait() , notify(), notifyAll(), sleep() and yield().

3. Spring Fundamentals

  • Key Spring Boot annotations (@Component, @Service, @Repository, @Autowired, etc.) and how they work. (Learn)
  • Dependency Injection. (Learn)
  • Dependency Inversion Principle. (Learn)
  • Bean life cycle. (Learn)
  • Spring caching mechanisms. (Learn)
Problem approach

Tip 1: Learn the purpose and correct usage of common Spring annotations and how they affect dependency injection and bean management.
Tip 2: Explore annotations like @Cacheable, @CacheEvict, and @CachePut and understand how caching improves application performance.
Tip 3: Build small Spring Boot projects to apply annotations and caching practically, reinforcing understanding for interviews.

4. SQL

  • Writing queries using GROUP BY clause. (Learn)
  • Filtering grouped results using HAVING clause. (Learn)
Problem approach

Tip 1: Practice GROUP BY with aggregation functions.
Tip 2: Use HAVING to filter grouped results.
Tip 3: Practice Query Optimization.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
907 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2581 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes