Interview guides · Discover

Discover Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Discover, you are at the heart of a massive, high-scale financial ecosystem. You will be tasked with building, maintaining, and scaling the complex digital infrastructure that powers credit, banking, and payment services for millions of customers. This role is not just about writing code; it is about ensuring the reliability, security, and performance of systems that must function flawlessly under extreme transaction volumes. You will typically operate within cross-functional teams, collaborating closely with Product Managers, Architects, and Data Engineers to translate business needs into technical solutions. Whether you are working on Java-based microservices, cloud-native infrastructure, or customer-facing applications, your contributions directly impact the financial well-being of users.

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

Focus areas

Programming (general coding skills)
Java
Object-Oriented Programming (OOP)

The Discover interview process

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

Recruiter Screen

Initial contact with a recruiter to assess candidate fit for the role.

What to demonstrate

Initial contact with a recruiter to assess candidate fit for the role
Depth in Programming (general coding skills)

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 Assessment

Candidates undergo a technical assessment, which may include an online assessment or a technical phone screen.

What to demonstrate

Candidates undergo a technical assessment, which may include an online assessment or a technical phone screen
Depth in Programming (general coding skills)

How to prepare

Answer aloud and timed: Explain the difference between monolithic architecture and microservices in the context of scaling a payment platform.
Answer aloud and timed: What are the key features of Spring Boot that facilitate dependency injection and service orchestration?

Superday Interviews

A series of back-to-back virtual interviews with various roles including Architects, Hiring Managers, and Senior Developers.

What to demonstrate

A series of back-to-back virtual interviews with various roles including Architects, Hiring Managers, and Senior Developers
Depth in Programming (general coding skills)

How to prepare

Answer aloud and timed: How do you handle database connectivity and transaction management in a distributed system?
Answer aloud and timed: Design an e-commerce system capable of handling high traffic during peak holiday seasons.

Where candidates lose points

Own your resume

Every project listed is fair game for a deep dive. Be prepared to explain the "why" behind every technology stack choice you made.

Practice Whiteboarding

Even in a virtual setting, practice explaining your architectural diagrams clearly. A messy diagram often reflects a messy thought process.

Prepare your own questions

Use the time at the end of the interview to ask about the team’s current technical challenges. It shows you are already thinking like a member of the team.

Stay calm under pressure

If you are asked a question you don't know, don't panic. Explain your thought process and how you would go about finding the answer.

Questions & practice

Describe the internal implementation of Java Collections or Multithreading in a high-concurrency environment.

Medium · Technical & Domain Expertise

Approach

Say what the runtime actually does before reasoning about the code.
Name what is shared across threads and what owns each piece of state.
Identify the window where an invariant is briefly untrue.
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?

How do you manage memory allocation and Garbage Collection (GC) in a high-throughput Java application?

Medium · Technical & Domain Expertise

Approach

Say what the runtime actually does before reasoning about the code.
Name what is shared across threads and what owns each piece of state.
Identify the window where an invariant is briefly untrue.
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?

Identify the heaviest tenants in a five-minute window under memory pressure

Medium · top-k · heavy hitters · streaming

The edge service handles about 3,000 requests per second across roughly 50,000 tenants, peaking near 9,000. Expose the 50 heaviest tenants by request count over the trailing five minutes so limits can be tightened before one tenant's backfill starves the fleet. You may not retain five minutes of raw records. Give the exact solution and its memory, then the bounded-memory approximation with its error stated as a formula, and say which you would ship and at what tenant cardinality that choice changes.

Approach

Do the exact version first, because it is affordable at this cardinality: a ring of 300 one-second counters per tenant, advanced lazily, is 1,200 bytes of counters per tenant and roughly 60 to 90 MB for 50,000 tenants with overhead. Carry a running total and subtract the bucket you overwrite so a window read is O(1) rather than 300 adds.
Extract the top 50 with a size-k min-heap over the tenant sums: O(d log k) for d tenants, against O(d log d) to sort them all. Maintaining the heap continuously instead of on query requires a tenant-to-heap-index map, because incrementing a count already inside the heap means sifting from a known position, and without that map you rebuild the heap on every request.
State the approximation precisely rather than gesturing at sketches. Misra-Gries with m counters retains every item whose true count exceeds N/(m+1), and each retained count underestimates the truth by at most N/(m+1). With m = 1,000 and N = 900,000 requests in the window the error is roughly 900 requests, which is fine for spotting a tenant sending 50,000 and useless for ranking two tenants 200 apart.
Say what breaks when the window slides: Misra-Gries and Space-Saving are insert-only and cannot be decremented as records age out. The workable construction is one summary per sub-window, say ten seconds, with 30 summaries merged at query time, and the merged error is the sum of the per-summary errors, so the bound degrades linearly in the number of sub-windows.

Follow-up

The heaviest tenant is heavy because of one export job rather than user traffic. Should the limiter treat those as the same tenant?
Two tenants sit tied at the boundary of the top 50. Does your answer flap, and does the flapping matter?

Describe the trade-offs between SQL and NoSQL databases for a transactional financial application.

Medium · System Design & Architecture

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?

Keep soft-deleted accounts from blocking re-registration

Easy · soft delete · unique constraints · engine differences

app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.

Approach

Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.

Follow-up

A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
How do you honour an erasure request while resource_revision.actor_user_id still references this table?

Explain the difference between monolithic architecture and microservices in the context of scaling a payment p

Medium · Technical & Domain Expertise

Explain the difference between monolithic architecture and microservices in the context of scaling a payment platform.

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 are the key features of Spring Boot that facilitate dependency injection and service orchestration?

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?

Design an e-commerce system capable of handling high traffic during peak holiday seasons.

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 implement a caching strategy to reduce latency in a distributed microservices 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?

Explain the role of message queues (e.g., Kafka) in decoupling services and ensuring system resilience.

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 ensure data consistency across multiple microservices?

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?

p99 jumped on one listing filter while p50 stayed flat

Medium · query planning · composite index · percentiles

After a release that added an owner_user_id filter to the resource listing, p99 rose from 90 ms to 1.9 s while p50 stayed at 40 ms. Traffic and row counts are unchanged. resource carries the index (tenant_id, status, updated_at DESC, resource_id DESC). The new query filters tenant_id and owner_user_id, orders by updated_at DESC, resource_id DESC, and takes 20 rows. On PostgreSQL, explain the shape of the regression, prove it from a query plan, and give the index you would add.

Approach

Start from the shape. A flat p50 with a moved p99 means a subset of requests changed cost, not all of them, so the first job is naming the subset. Bucket the endpoint's latency by the tenant's row count; the natural hypothesis is that large tenants are a small share of requests and all of the tail.
Get the plan for the new query on a large tenant with EXPLAIN (ANALYZE, BUFFERS). Expect an index scan over the tenant's range, a filter discarding most of it, then a Sort feeding the Limit, possibly reporting Sort Method: external merge Disk. Read actual rows on the scan node, not estimated.
Explain why the existing index cannot serve it. A composite B-tree is seekable only as a left prefix, and with no equality predicate on status the scan cannot treat updated_at as an ordering, because rows in the tenant's range are ordered by status first. Everything matching must be read and sorted before LIMIT 20 can apply, so a tenant with 400,000 rows pays 400,000 rows to return 20.
Add (tenant_id, owner_user_id, updated_at DESC, resource_id DESC). Equality on the first two columns leaves the index ordered by updated_at within that pair, so the plan becomes an index scan that stops after 20 rows with no Sort node. PostgreSQL can scan a B-tree backwards, so the DESC markers matter only if the two sort columns ever disagree in direction; keeping them explicit documents the order the keyset cursor depends on.

Follow-up

The endpoint paginates with OFFSET. What does page 500 cost with your index, and what does the keyset version cost?
How would you have caught this before release, given that a 10,000-row seed database produces the same plan shape at an unnoticeable cost?

Suggested practice checklist

Built from the rounds and topics Discover candidates report.

Day 1 — Map the Discover loop

Write out the reported sequence: Recruiter Screen, Technical Assessment, Superday 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 (general coding skills)

Spend the session on Programming (general coding skills), which Discover candidates report being tested on.
Write one worked example in Programming (general coding skills) and time yourself on it.

Deliverable: One timed worked example in Programming (general coding skills).

Day 3 — Work Java

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

Deliverable: One timed worked example in Java.

Day 4 — Work Object-Oriented Programming (OOP)

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

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

Day 5 — Answer out loud: Technical & Domain Expertise

Answer aloud, timed: Describe the internal implementation of Java Collections or Multithreading in a high-concurrency environment.
Answer aloud, timed: How do you manage memory allocation and Garbage Collection (GC) in a high-throughput Java application?

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

Day 6 — Answer out loud: System Design & Architecture

Answer aloud, timed: Design an e-commerce system capable of handling high traffic during peak holiday seasons.
Answer aloud, timed: How would you implement a caching strategy to reduce latency in a distributed microservices environment?

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 resolve a conflict within your engineering team.
Answer aloud, timed: Describe a challenging technical problem you solved and how you communicated your approach to stakeholders.

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.

How do you handle database connectivity and transaction management in a distributed system?

Medium · Technical & Domain Expertise

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?