cswork / libraryOpen practice workspace

Interview guides · Signifyd

Signifyd Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Signifyd, you play a foundational role in building and scaling the advanced technology that powers fraud-free commerce for thousands of merchants across more than 100 countries. You are responsible for designing, developing, and maintaining robust distributed systems that securely process billions of global transactions every year. Your daily work directly impacts how online retailers approve more good orders, eliminate fraud, and deliver frictionless shopping experiences to their customers at enterprise scale. Operating within a fast-paced, collaborative engineering organization, you will tackle complex distributed challenges across application development, cloud platforms, and infrastructure.

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

Focus areas

  • Programming problem solving
  • Data structures
  • Algorithms

The Signifyd interview process

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

Phone Screening

Initial discussion to assess your background and fit for the role.

What to demonstrate

  • Initial discussion to assess your background and fit for the role
  • Depth in Programming problem solving

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 Coding Challenge

Complete a coding challenge to evaluate practical skills.

What to demonstrate

  • Complete a coding challenge to evaluate practical skills
  • Depth in Programming problem solving

How to prepare

  • Answer aloud and timed: Describe a time when you had to refactor a critical piece of legacy code in production. How did you ensure zero downtime and maintain system stability?
  • Answer aloud and timed: Write an algorithm to parse and process a continuous stream of structured data under strict memory constraints.

Technical Interviews

Series of interviews including live coding exercises and discussions about past experiences.

What to demonstrate

  • Series of interviews including live coding exercises and discussions about past experiences
  • Depth in Programming problem solving

How to prepare

  • Answer aloud and timed: How would you design a data structure to efficiently query and retrieve frequently accessed transaction logs?
  • Answer aloud and timed: Given an array of numerical identifiers, implement a function that finds the contiguous sub-array with the maximum sum.

Where candidates lose points

Communicate your thought process

Never code in silence. Talk through your assumptions, explore alternative approaches out loud, and explain why you chose a specific data structure or design pattern.

Focus on production realities

When discussing past projects or answering system design prompts, always address edge cases, failure modes, monitoring, and scalability rather than just writing happy-path code.

Prepare for code reviews

Expect interviewers to present existing code snippets for review. Practice identifying potential bugs, security vulnerabilities, and readability improvements quickly.

Embrace collaborative hints

If your interviewer offers a nudge or hints that you are heading down a complex path, pause, listen carefully, and adjust your approach. They want to see how well you collaborate under guidance.

Questions & practice

Write an algorithm to parse and process a continuous stream of structured data under strict memory constraints

Medium · Coding & Algorithms

Write an algorithm to parse and process a continuous stream of structured data under strict memory constraints.

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?

Given an array of numerical identifiers, implement a function that finds the contiguous sub-array with the max

Medium · Coding & Algorithms

Given an array of numerical identifiers, implement a function that finds the contiguous sub-array with the maximum sum.

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?

Diff a projection against the primary without per-row point reads

Hard · reconciliation · range hashing · throttling

The listing projection has drifted and some rows show a stale version. The primary holds 40,000,000 resource rows across 12,000 tenants while serving 1,200 writes and 14,000 reads per second. The obvious repair, reading each resource row and comparing its version against the projection, is correct and would eventually finish. Explain precisely why it is unacceptable here, then give a diff that finds the differing rows, state its complexity, and make it safe to run against a live primary. Replication lag is usually under 100 ms and is not bounded.

Approach

  1. Quantify the naive cost rather than calling it slow: 40,000,000 point reads at even 0.5 ms each is over five hours serialised, and the only lever is concurrency, which is exactly what you cannot spend. The primary's pool is sized for the write path, and 40,000,000 random reads evict the buffer cache that sustains the 85 percent cache hit rate, so the audit degrades the system it is auditing.
  2. Replace random access with one ordered pass per side. Both sides can be read in (tenant_id, resource_id) order, which is a sequential scan on each and a merge join in O(n) time and O(1) memory. For a dense diff that is the whole answer, and it reads the primary once instead of 40,000,000 times.
  3. For the expected sparse case, compare range hashes instead of rows: partition the key space, compute per range an order-independent aggregate over hash(resource_id, version), compare aggregates, and descend only into ranges that differ. With d differing rows and branching factor B, at most d ranges mismatch per level, so the drill-down examines O(d log_B(n/d)) ranges and reads full rows only in mismatching leaves.
  4. Aggregate with a sum modulo 2^64 or a multiset hash, never XOR. XOR is order-independent but self-cancelling, so two rows wrong in the same way, or a row duplicated on one side, leave the range aggregate matching and the range is declared clean.

Follow-up

  • The diff reports 900 stale rows. How do you decide between patching those rows and rebuilding the projection from resource_revision?
  • Same job, but the projection lives in a search index that cannot be scanned in key order. What changes?

Explain why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

  1. Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
  2. For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
  3. Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
  4. Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

  • 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
  • A dashboard runs this for 40 owners in one page load. What changes about the design?

Replace offset paging on the resource feed with keyset

Easy · keyset pagination · composite index · sort order

resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.

Approach

  1. Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
  2. Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
  3. Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
  4. Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.

Follow-up

  • The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
  • Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?

Walk me through the architecture of a complex project you built and explain why you chose specific models, fra

Medium · Project Deep-Dive & Architecture

Walk me through the architecture of a complex project you built and explain why you chose specific models, frameworks, or cloud components.

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?

How did you approach performance bottlenecks in your previous distributed systems, and what metrics did you us

Medium · Project Deep-Dive & Architecture

How did you approach performance bottlenecks in your previous distributed systems, and what metrics did you use to validate your improvements?

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?

How would you design a data structure to efficiently query and retrieve frequently accessed transaction logs?

Medium · Coding & Algorithms

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?

How would you design a scalable cloud-native ingestion pipeline capable of handling sudden spikes in global tr

Medium · System Design & Infrastructure

How would you design a scalable cloud-native ingestion pipeline capable of handling sudden spikes in global transaction volume?

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?

What strategies would you implement to ensure high availability and disaster recovery across multiple cloud re

Medium · System Design & Infrastructure

What strategies would you implement to ensure high availability and disaster recovery across multiple cloud regions?

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?

How do you approach securing microservices communicating across an enterprise cloud platform?

Medium · System Design & Infrastructure

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?

Listing latency scales with page size, not with filters

Easy · n+1 · latency · query batching

The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.

Approach

  1. Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
  2. Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
  3. Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
  4. Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.

Follow-up

  • The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
  • How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?

Suggested practice checklist

Built from the rounds and topics Signifyd candidates report.

Day 1 — Map the Signifyd loop

  • Write out the reported sequence: Phone Screening, Technical Coding Challenge, Technical Interviews.
  • 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 3 reported rounds, with the weakest marked.

Day 2 — Work Programming problem solving

  • Spend the session on Programming problem solving, which Signifyd candidates report being tested on.
  • Write one worked example in Programming problem solving and time yourself on it.

Deliverable: One timed worked example in Programming problem solving.

Day 3 — Work Data structures

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

Deliverable: One timed worked example in Data structures.

Day 4 — Work Algorithms

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

Deliverable: One timed worked example in Algorithms.

Day 5 — Answer out loud: Project Deep-Dive & Architecture

  • Answer aloud, timed: Walk me through the architecture of a complex project you built and explain why you chose specific models, frameworks, or cloud components.
  • Answer aloud, timed: How did you approach performance bottlenecks in your previous distributed systems, and what metrics did you use to validate your improvements?

Deliverable: Spoken answers to 2 reported Project Deep-Dive & Architecture question(s), under time.

Day 6 — Answer out loud: Coding & Algorithms

  • Answer aloud, timed: Write an algorithm to parse and process a continuous stream of structured data under strict memory constraints.
  • Answer aloud, timed: How would you design a data structure to efficiently query and retrieve frequently accessed transaction logs?

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

Day 7 — Answer out loud: System Design & Infrastructure

  • Answer aloud, timed: How would you design a scalable cloud-native ingestion pipeline capable of handling sudden spikes in global transaction volume?
  • Answer aloud, timed: What strategies would you implement to ensure high availability and disaster recovery across multiple cloud regions?

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

Behavioural preparation

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

Describe a time when you had to refactor a critical piece of legacy code in production. How did you ensure zer

Medium · Project Deep-Dive & Architecture

Describe a time when you had to refactor a critical piece of legacy code in production. How did you ensure zero downtime and maintain system stability?

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 situations where product requirements are ambiguous or shifting rapidly mid-sprint?

Medium · Behavioral & Collaboration

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 how you collaborate with Product Managers when a technical debt reduction ticket conflicts with a maj

Medium · Behavioral & Collaboration

Describe how you collaborate with Product Managers when a technical debt reduction ticket conflicts with a major feature release.

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 mentor junior engineers and handle constructive code reviews within your team?

Medium · Behavioral & Collaboration

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?