cswork / libraryOpen practice workspace

Interview guides · Sutherland

Sutherland Software Engineer Interview Guide

Sutherland Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

A Software Engineer at Sutherland plays a key role in driving digital transformation and process optimization for a global client base. Sutherland is a leading digital transformation company that integrates cutting-edge technology, analytics, and business process services. As an engineer here, you are not just writing code; you are building, scaling, and maintaining high-performance systems that directly impact enterprise operations, healthcare systems, retail networks, and financial platforms. In this role, you will work on modernizing legacy architectures, developing robust APIs, and deploying scalable microservices. The systems you build enable seamless user experiences and optimize backend efficiency, serving millions of end-users globally.

This guide is scoped to a Software Engineer candidate at Sutherland.

Focus areas

  • Python
  • OOPs (Object-Oriented Programming)
  • Data Structures & Algorithms (DSA)

The Sutherland interview process

Sutherland candidates report 4 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Initial Screening

Candidates undergo an initial screening or automated online assessment, typically containing aptitude questions and coding challenges.

What to demonstrate

  • Candidates undergo an initial screening or automated online assessment, typically containing aptitude questions and coding challenges
  • Depth in Python

How to prepare

  • Be able to walk your CV end to end in two minutes, and say why this company specifically.
  • Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.

Technical Rounds

Candidates participate in one or more technical rounds focusing on practical knowledge and core computer science concepts.

What to demonstrate

  • Candidates participate in one or more technical rounds focusing on practical knowledge and core computer science concepts
  • Depth in Python

How to prepare

  • Answer aloud and timed: Explain the differences between abstract classes and interfaces in Java or.NET.
  • Answer aloud and timed: How does inheritance work in Python, and how is the Method Resolution Order (MRO) determined?

Techno-Managerial Round

This round assesses system design skills and managerial competencies.

What to demonstrate

  • This round assesses system design skills and managerial competencies
  • Depth in Python

How to prepare

  • Answer aloud and timed: What is the difference between value types and reference types?
  • Answer aloud and timed: Write a program to find duplicate elements in an array or list in O(n) time complexity.

HR Evaluation

Final evaluation by HR, discussing communication skills and location preferences.

What to demonstrate

  • Final evaluation by HR, discussing communication skills and location preferences
  • Depth in Python

How to prepare

  • Answer aloud and timed: How do you reverse a string in-place without using built-in language functions?
  • Answer aloud and timed: Explain how a hash map works internally and how collision resolution is handled.

Where candidates lose points

Structure Your Project Explanations

Use the STAR method (Situation, Task, Action, Result) when explaining your past projects. Be ready to discuss the team size, the tech stack, and your specific individual contributions clearly.

Focus on Code Readability

During live coding rounds, write clean code with meaningful variable names. Explain your logic as you write, so the interviewer can follow your thought process even if you make a minor syntax error.

Avoid relying on external aids or taking too long to start coding during live technical rounds

Interviewers expect you to talk through your logic immediately.

Brush Up on Core CS Fundamentals

Do not skip basic concepts like SQL joins, database normalization, OOPs pillars, and basic networking protocols. These are frequently asked across all experience levels.

Questions & practice

What is the difference between value types and reference types?

Medium · OOPs & Core Programming Fundamentals

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Write a program to find duplicate elements in an array or list in O(n) time complexity.

Medium · Data Structures & Algorithms (DSA)

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

How do you reverse a string in-place without using built-in language functions?

Medium · Data Structures & Algorithms (DSA)

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Explain how a hash map works internally and how collision resolution is handled.

Medium · Data Structures & Algorithms (DSA)

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Write a function to check if a given string is a palindrome.

Medium · Data Structures & Algorithms (DSA)

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Find the second largest number in an unsorted array in a single traversal.

Medium · Data Structures & Algorithms (DSA)

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Explain the concept of multi-threading and how deadlock prevention is implemented in an operating system.

Medium · Databases & Core Computer Science

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Describe a situation where you had to work with ambiguous technical requirements. How did you resolve it?

Medium · Behavioral & Project Architecture

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

What is database normalization, and what are the differences between 2NF and 3NF?

Medium · Databases & Core Computer Science

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Write a SQL query to find the second-highest salary from an Employee table.

Medium · Databases & Core Computer Science

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Explain the difference between an inner join and a left join with performance implications.

Medium · Databases & Core Computer Science

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Why do you want to join Sutherland, and what do you know about our digital transformation services?

Medium · Behavioral & Project Architecture

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Explain the four pillars of Object-Oriented Programming (OOPs) with real-world examples.

Medium · OOPs & Core Programming Fundamentals

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

What are decorators in Python, and how do you write a custom decorator?

Medium · OOPs & Core Programming Fundamentals

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Explain the differences between abstract classes and interfaces in Java or.NET.

Medium · OOPs & Core Programming Fundamentals

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

How does inheritance work in Python, and how is the Method Resolution Order (MRO) determined?

Medium · OOPs & Core Programming Fundamentals

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

What is the difference between TCP and UDP, and when would you use each?

Medium · Databases & Core Computer Science

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Walk me through the architecture of your most recent project. What was your individual contribution?

Medium · Behavioral & Project Architecture

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Read latency spikes on a sixty-second sawtooth

Medium · cache stampede · single-flight · ttl

The cached listing read path serves about 14k reads/second at an 85% hit rate. p99 sits at 35 ms for 57 seconds, jumps to 900 ms for 3, and repeats. During each spike the primary shows several hundred identical listing queries starting within the same millisecond, all carrying one large tenant's id. Cache entries use a 60-second TTL. Give the mechanism, the ordered checks, the fix, and the correctness hazard your fix must not introduce.

Approach

  1. Match the period to a configured number before theorising about load. A spike every 60 seconds against a 60-second TTL is an entry expiring, and you confirm it by correlating spike timestamps with the entry's write time rather than with the traffic curve. If the period had matched a cron or a GC interval instead, this is a different investigation.
  2. Establish the concurrency of the miss. Several hundred identical queries in one millisecond means the miss path has no coalescing: every request that arrives between expiry and repopulation recomputes. The herd size is that key's arrival rate times its recompute time, so at 1.2k reads/second for the hot key and a 250 ms recompute you expect about 300 concurrent misses, which matches what is observed.
  3. Add single-flight on the miss path so one caller per key recomputes under a short-lived lock while the rest wait for its result. Prefer stale-while-revalidate where the read tolerates it: return the expired value immediately and refresh asynchronously, which removes the latency spike rather than serialising it into a queue of waiters.
  4. De-synchronise the keys. Write TTLs with jitter, for example 60 seconds plus or minus 10%, so a deploy or a mass invalidation does not align every key on the same second and turn a per-key herd into a fleet-wide one.

Follow-up

  • The same sawtooth appears on a key that is invalidated on write rather than expired. Is that the same bug?
  • How does your answer change if the recompute takes 4 seconds instead of 250 ms?

Suggested practice checklist

Built from the rounds and topics Sutherland candidates report.

Day 1 — Map the Sutherland loop

  • Write out the reported sequence: Initial Screening, Technical Rounds, Techno-Managerial Round, HR Evaluation.
  • For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 4 reported rounds, with the weakest marked.

Day 2 — Work Python

  • Spend the session on Python, which Sutherland candidates report being tested on.
  • Write one worked example in Python and time yourself on it.

Deliverable: One timed worked example in Python.

Day 3 — Work OOPs (Object-Oriented Programming)

  • Spend the session on OOPs (Object-Oriented Programming), which Sutherland candidates report being tested on.
  • Write one worked example in OOPs (Object-Oriented Programming) and time yourself on it.

Deliverable: One timed worked example in OOPs (Object-Oriented Programming).

Day 4 — Work Data Structures & Algorithms (DSA)

  • Spend the session on Data Structures & Algorithms (DSA), which Sutherland candidates report being tested on.
  • Write one worked example in Data Structures & Algorithms (DSA) and time yourself on it.

Deliverable: One timed worked example in Data Structures & Algorithms (DSA).

Day 5 — Answer out loud: OOPs & Core Programming Fundamentals

  • Answer aloud, timed: Explain the four pillars of Object-Oriented Programming (OOPs) with real-world examples.
  • Answer aloud, timed: What are decorators in Python, and how do you write a custom decorator?

Deliverable: Spoken answers to 2 reported OOPs & Core Programming Fundamentals question(s), under time.

Day 6 — Answer out loud: Data Structures & Algorithms (DSA)

  • Answer aloud, timed: Write a program to find duplicate elements in an array or list in O(n) time complexity.
  • Answer aloud, timed: How do you reverse a string in-place without using built-in language functions?

Deliverable: Spoken answers to 2 reported Data Structures & Algorithms (DSA) question(s), under time.

Day 7 — Answer out loud: Databases & Core Computer Science

  • Answer aloud, timed: What is database normalization, and what are the differences between 2NF and 3NF?
  • Answer aloud, timed: Write a SQL query to find the second-highest salary from an Employee table.

Deliverable: Spoken answers to 2 reported Databases & Core Computer Science question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

What was the team size in your previous project, and how did you handle conflicts regarding technical decision

Medium · Behavioral & Project Architecture

What was the team size in your previous project, and how did you handle conflicts regarding technical decisions?

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Where do you see yourself in the next five years, and how does this role at Sutherland align with that vision?

Medium · Behavioral & Project Architecture

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Ship under a deadline and bound the debt you chose

Medium · pagination · technical debt · tradeoffs

You have four days to ship a tenant-facing listing endpoint. The version you would defend uses keyset pagination over (tenant_id, status, updated_at DESC, resource_id DESC); the version you can finish uses LIMIT/OFFSET with no matching index. Describe a deadline call you actually made of this shape: what you shipped, what you knowingly deferred, how you bounded the damage with a mechanism rather than an intention, and the specific numeric condition that would force the follow-up. Name who you told and where you wrote it down.

Approach

  1. Name the deferred failure precisely instead of calling it slow. OFFSET n makes the database produce and discard n rows, so cost grows with page depth; without an index matching the sort, every matching row is read and sorted before the limit applies; and rows inserted between two page fetches shift across the boundary so items are skipped or repeated with nothing in the response to signal it.
  2. Bound the blast radius with something mechanical rather than a promise: cap maximum page depth, cap page size, restrict the endpoint to one internal caller, or keep it behind a flag. State which failure each cap removes and which it leaves standing.
  3. Attach a number to the trigger and wire it to an alarm: the first tenant crossing N resources, or the endpoint's p99 crossing its share of the 400 ms budget, so the debt announces itself instead of waiting to be remembered.
  4. Write it where the next engineer looks, which is the code and the ticket, not a chat message: what was deferred, why, the cap, and the trigger.

Follow-up

  • At what page depth does the offset version breach your latency budget, given your page size and row counts?
  • What breaks first when you switch to keyset pagination later, and what does a client holding an old page token see?