Deel Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at Deel, you are at the core of a product that is fundamentally reshaping how global teams collaborate, hire, and get paid. You will be responsible for building, scaling, and maintaining the infrastructure that powers complex financial operations, payroll compliance, and cross-border employment workflows. Your work directly impacts the lives of thousands of workers worldwide, ensuring that payments are accurate, compliant, and timely. This role is both technically demanding and strategically significant. You will often work on high-concurrency systems, complex database transactions, and integrations that require a deep understanding of distributed systems and relational data integrity.

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

Focus areas

• Database concurrency
• Backend development
• System design

The Deel interview process

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

Recruiter Screen

Initial screening call with a recruiter to discuss your background and fit for the role.

What to demonstrate

• Initial screening call with a recruiter to discuss your background and fit for the role
• Depth in Database concurrency

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 Take-Home Assignment

Complete a take-home assignment focusing on core functionality, error handling, and concurrency.

What to demonstrate

• Complete a take-home assignment focusing on core functionality, error handling, and concurrency
• Depth in Database concurrency

How to prepare

• Answer aloud and timed: How would you optimize a slow SQL query that is causing performance bottlenecks?
• Answer aloud and timed: Describe a scenario where you would choose a transaction over an atomic update.

Technical Interviews

Participate in one or more technical interviews to assess your technical skills and decision-making.

What to demonstrate

• Participate in one or more technical interviews to assess your technical skills and decision-making
• Depth in Database concurrency

How to prepare

• Answer aloud and timed: How would you design an API to handle a high volume of payroll deposits?
• Answer aloud and timed: Describe your approach to designing a system that ensures idempotency.

Behavioral Discussion

Engage in a discussion focused on behavioral and leadership aspects of your experience.

What to demonstrate

• Engage in a discussion focused on behavioral and leadership aspects of your experience
• Depth in Database concurrency

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 discussion above and write down what you would ask to confirm before it.

Where candidates lose points

Prioritize Communication

When solving a problem, talk through your thought process. Interviewers are more interested in how you think than in seeing you reach a perfect solution instantly.

Understand the "Why

Don't just implement a feature; be ready to explain why you chose a specific library, database index, or architectural pattern over alternatives.

Be Prepared for Ambiguity

Many interviewers will provide vague requirements on purpose. Ask clarifying questions to narrow down the scope—this is a key indicator of seniority.

Review Your Fundamentals

Do not neglect basic SQL and concurrency concepts. Even if you are a frontend-focused engineer, expect questions on how your code interacts with data systems.

Questions & practice

How do you handle concurrent operations in a database to prevent race conditions?

Medium · Technical & Database Proficiency

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?

Find overlapping job attempts and peak concurrency from lease records

Medium · sweep line · intervals · leases

A day of job_run history yields about 50,000,000 attempt records: (job_run_id, job_type, attempt, started_at, finished_at which is NULL when the worker died, lease_expires_at). Leases expire on a clock, so a job that outran its lease ran twice. Produce (a) every job_run_id whose attempts overlapped in wall-clock time and (b) the peak number of simultaneously running attempts per job_type with the minute it occurred. Target O(n log n). State how you treat a NULL finished_at and what clock skew does to your answer.

Approach

1. Define the interval before sorting anything: an attempt occupies [started_at, COALESCE(finished_at, lease_expires_at)). finished_at is observed and lease_expires_at is only a promise, so every attempt without a finish contributes an estimate and the whole result is a lower bound on overlap rather than an exact count.
2. For peak concurrency, sweep: emit 2n endpoints, sort by (timestamp, kind) with ends ordered before starts at equal timestamps, then walk the sequence maintaining a counter per job_type and record each type's maximum with its timestamp. O(n log n) dominated by the sort, O(n) space, or O(1) extra if the sort is external and the walk streams.
3. For overlap detection, do not compare attempts pairwise. A single global sort by (job_run_id, started_at) gives both the grouping and the order; within a group, keep the maximum end seen so far and report an overlap exactly when the next start is less than that running maximum, which is one linear pass after the sort.
4. Half-open intervals matter and are easy to get wrong: with closed intervals an attempt ending at the same millisecond another begins reads as concurrency two, and across 50,000,000 records that artefact swamps the real signal.

Follow-up

• A handler is not idempotent and you have found 400 overlapping jobs. Which of them actually caused damage, and what would you query to find out?
• Peak concurrency for one job_type is 4 against a configured cap of 4. Is the cap working, or is the data hiding attempts that never started?

Merge partitioned event streams into one ordered feed with bounded lateness

Hard · k-way merge · watermarks · out-of-order streams

The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.

Approach

1. Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
2. Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
3. Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
4. Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.

Follow-up

• The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
• The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?

How would you optimize a slow SQL query that is causing performance bottlenecks?

Medium · Technical & Database Proficiency

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?

When would you choose to use denormalization in a database schema?

Medium · System Design & 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 difference between various database isolation levels and when you would use them.

Medium · Technical & Database Proficiency

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?

Describe a scenario where you would choose a transaction over an atomic update.

Medium · Technical & Database Proficiency

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 would you design an API to handle a high volume of payroll deposits?

Medium · System Design & 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?

Describe your approach to designing a system that ensures idempotency.

Medium · System Design & Architecture

Approach

1. Say who the caller is and what they do when the call fails halfway.
2. Define the identity of a request so a retry cannot double-apply it.
3. Separate accepted, pending, failed and confirmed; they are different facts.
4. Design the error taxonomy before the success shape; callers branch on it.

Follow-up

• What happens if the caller retries after a timeout?
• How does a client discover it is on an old version of this contract?

How would you structure a microservice to ensure high availability and fault tolerance?

Medium · System Design & 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?

One customer endpoint stalls deliveries to every other destination

Medium · bulkhead · timeouts · saturation

The egress service delivers about 1.5k webhooks/second across 40,000 destinations, with a per-destination concurrency cap of 4 and a 10-second connect-plus-read timeout. Throughput falls to 300/second, queue depth climbs, and p99 delivery latency for unaffected destinations goes from 200 ms to minutes, while the error rate barely moves. One tenant holds 900 destination rows whose URLs share a hostname that now answers in 9.5 seconds. Explain the mechanism with the arithmetic, then give the containment in the order you would apply it.

Approach

1. Look at saturation before errors. A flat error rate with collapsing throughput says nothing is failing, things are waiting, so the first signal to pull is in-flight request count or pool wait time rather than the error counter. This is the distinction that decides the whole investigation.
2. Group in-flight work by resolved host, not by destination id. The cap is keyed per destination row, so 900 rows sharing one hostname buy 3,600 concurrent slots against a single host, each held for 9.5 seconds. The bulkhead was never a bulkhead for that host, and grouping by the wrong dimension is why the dashboard looked healthy.
3. Do the arithmetic in both directions. Required concurrency is arrival rate times latency, so 1.5k/second at 200 ms needs about 300 in flight, which is entirely consumed by 3,600 slow slots; conversely whatever concurrency is left sustains rate equals concurrency divided by 9.5 seconds, which is the 300/second you are seeing. Matching both numbers is what promotes this from a plausible story to the mechanism.
4. Explain why the circuit breaker never helped. It opens on consecutive failures, and a 9.5-second response inside a 10-second timeout is a success. Slow is not failing, so an error-rate breaker cannot see this; you need a slow-call ratio, a deadline propagated from the caller's remaining budget, or a concurrency limiter.

Follow-up

• The host recovers to 80 ms. How long does the queue take to drain, and what does the drain do to the recovered host?
• Where should the 10-second timeout number actually come from?

Suggested practice checklist

Built from the rounds and topics Deel candidates report.

Day 1 — Map the Deel loop

• Write out the reported sequence: Recruiter Screen, Technical Take-Home Assignment, Technical Interviews, Behavioral Discussion.
• 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 Database concurrency

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

Deliverable: One timed worked example in Database concurrency.

Day 3 — Work Backend development

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

Deliverable: One timed worked example in Backend development.

Day 4 — Work System design

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

Deliverable: One timed worked example in System design.

Day 5 — Answer out loud: Technical & Database Proficiency

• Answer aloud, timed: How do you handle concurrent operations in a database to prevent race conditions?
• Answer aloud, timed: Explain the difference between various database isolation levels and when you would use them.

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

Day 6 — Answer out loud: System Design & Architecture

• Answer aloud, timed: How would you design an API to handle a high volume of payroll deposits?
• Answer aloud, timed: Describe your approach to designing a system that ensures idempotency.

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

Day 7 — Answer out loud: Behavioral & Leadership

• Answer aloud, timed: Tell me about a time you had to deal with a significant technical constraint.
• Answer aloud, timed: How do you handle disagreements with stakeholders regarding technical trade-offs?

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

Behavioural preparation

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

Tell me about a time you had to deal with a significant technical constraint.

Medium · Behavioral & Leadership

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?

How do you handle disagreements with stakeholders regarding technical trade-offs?

Medium · Behavioral & Leadership

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?

Describe a situation where you had to work under tight deadlines. How did you prioritize your tasks?

Medium · Behavioral & Leadership

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?