Interview guides · Equifax

Equifax Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Equifax, you are at the heart of an organization that manages massive, high-stakes data environments. Your work directly impacts the financial stability of millions by building, maintaining, and scaling the infrastructure that powers global credit reporting, identity verification, and fraud detection services. You are not just writing code; you are engineering trust in a digital economy that demands extreme precision and security. The role involves working within complex, enterprise-grade systems where performance, data integrity, and reliability are non-negotiable. You will collaborate with cross-functional teams—including architects, product managers, and security experts—to tackle challenges ranging from legacy system modernization to the development of cutting-edge cloud-native applications.

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

Focus areas

Data Structures & Algorithms (DSA)
Problem Solving (Algorithmic Thinking)
Whiteboard Coding / Whiteboarding

The Equifax interview process

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

Recruiter Screening

Initial discussion with a recruiter to review your background and fit for the role.

What to demonstrate

Initial discussion with a recruiter to review your background and fit for the role
Depth in Data Structures & Algorithms (DSA)

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 Assessments

Series of assessments including online coding challenges and technical deep dives with senior developers or architects.

What to demonstrate

Series of assessments including online coding challenges and technical deep dives with senior developers or architects
Depth in Data Structures & Algorithms (DSA)

How to prepare

Answer aloud and timed: Describe the lifecycle of a request in a RESTful API.
Answer aloud and timed: How would you optimize a slow-performing SQL query?

Managerial Interview

Final interview focusing on behavioral questions and alignment with team dynamics.

What to demonstrate

Final interview focusing on behavioral questions and alignment with team dynamics
Depth in Data Structures & Algorithms (DSA)

How to prepare

Answer aloud and timed: What are the advantages and disadvantages of using microservices compared to a monolithic architecture?
Answer aloud and timed: Given an array, how would you find the second-largest element without using standard sorting functions?

Where candidates lose points

Review your resume line by line

Be prepared to discuss any project or technology you have listed. If it is on your resume, it is fair game for an interviewer to ask about it in depth.

Understand the "Why

Don't just list what you used; explain why you chose a specific technology or architectural pattern over alternatives.

Ask insightful questions

Use the time at the end of the interview to ask about team culture, current technical challenges, or how the team measures success.

Communication is key

If you are stuck on a problem, talk through your thought process. Interviewers want to see how you troubleshoot and approach complex tasks.

Questions & practice

Given an array, how would you find the second-largest element without using standard sorting functions?

Medium · Problem Solving & 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?

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

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.
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.
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.
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?

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

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.
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.
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.
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?

How would you optimize a slow-performing SQL query?

Medium · Technical & Domain Expertise

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?

Denormalise tenant onto revisions and backfill it live

Hard · denormalisation · online migration · backfill

resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.

Approach

Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.

Follow-up

The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
How do you verify the backfill actually finished, given rows are still being inserted while it runs?

Explain the difference between interface and abstract class in Java.

Medium · Technical & Domain Expertise

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
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 do you manage transaction management in Spring Boot?

Medium · Technical & Domain Expertise

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
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 the lifecycle of a request in a RESTful API.

Medium · Technical & Domain Expertise

Approach

Say who the caller is and what they do when the call fails halfway.
Define the identity of a request so a retry cannot double-apply it.
Separate accepted, pending, failed and confirmed; they are different facts.
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?

What are the advantages and disadvantages of using microservices compared to a monolithic architecture?

Medium · Technical & Domain Expertise

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?

Walk me through the architecture of a project you have previously worked on.

Medium · Problem Solving & Coding

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-frequency data ingestion?

Medium · Problem Solving & Coding

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?

Describe a time you had to debug a complex production issue.

Medium · Problem Solving & Coding

Approach

Establish what changed and when, before forming any theory.
Pick a bisection that eliminates candidates whichever way it turns out.
Check the instrumentation before believing the symptom.
Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

What would you look at first, and what would it rule out?
How would you tell a cause from a coincidence here?

Suggested practice checklist

Built from the rounds and topics Equifax candidates report.

Day 1 — Map the Equifax loop

Write out the reported sequence: Recruiter Screening, Technical Assessments, Managerial 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 3 reported rounds, with the weakest marked.

Day 2 — Work Data Structures & Algorithms (DSA)

Spend the session on Data Structures & Algorithms (DSA), which Equifax 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 3 — Work Problem Solving (Algorithmic Thinking)

Spend the session on Problem Solving (Algorithmic Thinking), which Equifax candidates report being tested on.
Write one worked example in Problem Solving (Algorithmic Thinking) and time yourself on it.

Deliverable: One timed worked example in Problem Solving (Algorithmic Thinking).

Day 4 — Work Whiteboard Coding / Whiteboarding

Spend the session on Whiteboard Coding / Whiteboarding, which Equifax candidates report being tested on.
Write one worked example in Whiteboard Coding / Whiteboarding and time yourself on it.

Deliverable: One timed worked example in Whiteboard Coding / Whiteboarding.

Day 5 — Answer out loud: Technical & Domain Expertise

Answer aloud, timed: Explain the difference between interface and abstract class in Java.
Answer aloud, timed: How do you manage transaction management in Spring Boot?

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

Day 6 — Answer out loud: Problem Solving & Coding

Answer aloud, timed: Given an array, how would you find the second-largest element without using standard sorting functions?
Answer aloud, timed: How do you handle authentication and authorization in a distributed system?

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

Day 7 — Answer out loud: Behavioral & Cultural Fit

Answer aloud, timed: Tell me about a time you had to explain a technical concept to a non-technical stakeholder.
Answer aloud, timed: How do you handle disagreements with team members regarding technical implementation?

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

Behavioural preparation

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

How do you handle authentication and authorization in a distributed system?

Medium · Problem Solving & 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?