Interview guides · DTCC

DTCC Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at DTCC, you are at the heart of the global financial market's infrastructure. You will be responsible for building, maintaining, and scaling the critical systems that process trillions of dollars in securities transactions daily. Your work ensures the stability, security, and efficiency of the financial markets, directly impacting how capital moves across the globe. This role is not merely about writing code; it is about engineering high-availability, low-latency solutions that operate within a complex, highly regulated environment. You will work on a mix of modern distributed systems and legacy applications, requiring a balance of innovation and rigorous attention to detail.

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

Focus areas

Java
Data Structures & Algorithms (DSA)
SQL

The DTCC interview process

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

Recruiter Screening

Initial screening by a recruiter to assess qualifications and fit for the role.

What to demonstrate

Initial screening by a recruiter to assess qualifications and fit for the role
Depth in Java

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.

Digital Assessments

Candidates complete online assessments to evaluate aptitude and coding skills.

What to demonstrate

Candidates complete online assessments to evaluate aptitude and coding skills
Depth in Java

How to prepare

Answer aloud and timed: How do you handle multithreading in Java, and what are the common pitfalls?
Answer aloud and timed: Describe your approach to optimizing a slow SQL query.

Technical Panel Interview

One or more rounds of interviews focusing on technical skills and problem-solving.

What to demonstrate

One or more rounds of interviews focusing on technical skills and problem-solving
Depth in Java

How to prepare

Answer aloud and timed: Explain the concept of Exception Handling and how you implement it in your projects.
Answer aloud and timed: Describe the architecture of a recent project you worked on and why you made those design choices.

Behavioral Panel Interview

Interviews that assess behavioral competencies and cultural fit within the organization.

What to demonstrate

Interviews that assess behavioral competencies and cultural fit within the organization
Depth in Java

How to prepare

Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
Re-read the description of the behavioral panel interview above and write down what you would ask to confirm before it.

Where candidates lose points

Prepare your STAR stories

Have 3–5 concrete examples of your work ready, focusing on the Situation, Task, Action, and Result.

Brush up on fundamentals

Even if you are a senior engineer, be prepared to answer basic OOPs or SQL questions.

Know your resume

Be prepared to explain every line on your resume in detail.

Stay calm under pressure

If you get a "rapid-fire" set of questions, take a breath, answer clearly, and don't let the pace rattle you.

Questions & practice

Explain the difference between an ArrayList and a HashMap and when to use each.

Medium · Technical Proficiency & Coding

Approach

Restate the input: its shape, its size, and what is guaranteed about it.
Name the brute-force solution and its complexity before improving on it.
Choose the data structure from the access pattern, not from familiarity.
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 program to demonstrate an OOPs concept like polymorphism or abstraction.

Medium · Technical Proficiency & Coding

Approach

Restate the input: its shape, its size, and what is guaranteed about it.
Name the brute-force solution and its complexity before improving on it.
Choose the data structure from the access pattern, not from familiarity.
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 Exception Handling and how you implement it in your projects.

Medium · Technical Proficiency & Coding

Approach

Restate the input: its shape, its size, and what is guaranteed about it.
Name the brute-force solution and its complexity before improving on it.
Choose the data structure from the access pattern, not from familiarity.
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?

Describe your approach to optimizing a slow SQL query.

Medium · Technical Proficiency & Coding

Approach

Name the grain you start from and join outward from it.
Check whether any join is one-to-many before aggregating, or the sums inflate.
Say which index the query would use, and what makes it unusable.
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?

Hold a per-tenant active cap against concurrent creates

Hard · write skew · isolation levels · constraints

A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.

Approach

Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.

Follow-up

A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?

Describe the architecture of a recent project you worked on and why you made those design choices.

Medium · System Design & Architecture

Approach

Fix the scope first: who calls this, how often, and what they do when it fails.
Name the read and write paths separately; they rarely have the same bottleneck.
Choose a partition key and say what query it makes expensive.
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?

How would you design a system to handle high-volume transaction data?

Medium · System Design & Architecture

Approach

Fix the scope first: who calls this, how often, and what they do when it fails.
Name the read and write paths separately; they rarely have the same bottleneck.
Choose a partition key and say what query it makes expensive.
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?

Explain how you ensure data consistency in a distributed environment.

Medium · System Design & Architecture

Approach

Fix the scope first: who calls this, how often, and what they do when it fails.
Name the read and write paths separately; they rarely have the same bottleneck.
Choose a partition key and say what query it makes expensive.
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?

How do you approach the migration of a legacy system to a modern stack?

Medium · System Design & Architecture

Approach

Fix the scope first: who calls this, how often, and what they do when it fails.
Name the read and write paths separately; they rarely have the same bottleneck.
Choose a partition key and say what query it makes expensive.
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?

What tools do you use for performance monitoring and observability?

Medium · System Design & Architecture

Approach

Fix the scope first: who calls this, how often, and what they do when it fails.
Name the read and write paths separately; they rarely have the same bottleneck.
Choose a partition key and say what query it makes expensive.
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

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.
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.
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.
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 DTCC candidates report.

Day 1 — Map the DTCC loop

Write out the reported sequence: Recruiter Screening, Digital Assessments, Technical Panel Interview, Behavioral Panel Interview.
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 Java

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

Deliverable: One timed worked example in Java.

Day 3 — Work Data Structures & Algorithms (DSA)

Spend the session on Data Structures & Algorithms (DSA), which DTCC 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 4 — Work SQL

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

Deliverable: One timed worked example in SQL.

Day 5 — Answer out loud: Technical Proficiency & Coding

Answer aloud, timed: Explain the difference between an ArrayList and a HashMap and when to use each.
Answer aloud, timed: Write a program to demonstrate an OOPs concept like polymorphism or abstraction.

Deliverable: Spoken answers to 2 reported Technical Proficiency & Coding question(s), under time.

Day 6 — Answer out loud: System Design & Architecture

Answer aloud, timed: Describe the architecture of a recent project you worked on and why you made those design choices.
Answer aloud, timed: How would you design a system to handle high-volume transaction data?

Deliverable: Spoken answers to 2 reported System Design & Architecture question(s), under time.

Day 7 — Answer out loud: Behavioral & Situational

Answer aloud, timed: Describe a time you handled a high-severity production incident.
Answer aloud, timed: How do you manage competing priorities when working on multiple projects?

Deliverable: Spoken answers to 2 reported Behavioral & Situational question(s), under time.

Behavioural preparation

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

How do you handle multithreading in Java, and what are the common pitfalls?

Medium · Technical Proficiency & Coding

Approach

Pick a story where you made the decision, not one where you watched it.
State the situation in two sentences and spend the rest on the reasoning.
Give the blast radius: what could have broken, and what you measured.
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?