JPMC Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at JPMC, you are at the core of the world’s most sophisticated financial infrastructure. You will be responsible for building, maintaining, and scaling high-performance systems that handle trillions of dollars in transactions daily. Your work directly impacts global markets, client security, and the efficiency of financial services, requiring a blend of technical precision and a deep understanding of reliability and scale. This role is not just about writing code; it is about engineering robust solutions that function under extreme pressure. Whether you are working on backend Java services, cloud-native architecture, or real-time data processing, you will be expected to solve complex problems that prioritize security, consistency, and performance.

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

Focus areas

• System Design
• DSA (Data Structures & Algorithms)
• Java (Programming Language)

The JPMC interview process

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

Online Assessment

Initial screening to assess fundamental coding proficiency through an automated test.

What to demonstrate

• Initial screening to assess fundamental coding proficiency through an automated test
• Depth in System Design

How to prepare

• Answer aloud and timed: Make the entire array contain only distinct elements and return the minimum total cost.
• Answer aloud and timed: Return the sum modulo 10 from an array of integers.

Technical Interviews

Series of interviews focusing on technical depth and problem-solving skills.

What to demonstrate

• Series of interviews focusing on technical depth and problem-solving skills
• Depth in System Design

How to prepare

• Answer aloud and timed: Implement efficient search and sort algorithms for large datasets.
• Answer aloud and timed: Optimize space and time complexity for array manipulation tasks.

Behavioral Interviews

Interviews assessing cultural fit and collaboration skills with hiring managers and senior engineers.

What to demonstrate

• Interviews assessing cultural fit and collaboration skills with hiring managers and senior engineers
• Depth in System Design

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

Superday

Multiple back-to-back interview rounds in a single day to evaluate endurance and communication under pressure.

What to demonstrate

• Multiple back-to-back interview rounds in a single day to evaluate endurance and communication under pressure
• Depth in System Design

How to prepare

• Answer aloud and timed: Explain how to ensure horizontal scalability in a distributed backend system.
• Answer aloud and timed: Walk through a complex technical challenge you faced in your previous role and how you resolved it.

Where candidates lose points

Prioritize Clarity

When explaining your thought process, speak out loud. Your interviewer is evaluating your communication as much as your code.

Master the Basics

Don't get lost in niche frameworks. Ensure your fundamentals in data structures, algorithms, and system design are rock-solid.

Ask Clarifying Questions

Before writing a single line of code, ask about constraints, data volume, and expected behavior. This shows professional maturity.

Review Your Resume

Be prepared to discuss every project listed on your resume in extreme detail. Know the "why" behind every technical decision you made.

Prepare for Code Reviews

Treat the code review round as a collaborative exercise. Be open to feedback and explain your reasoning behind your design choices.

Questions & practice

Make the entire array contain only distinct elements and return the minimum total cost.

Medium · Coding and Algorithms

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?

Return the sum modulo 10 from an array of integers.

Medium · Coding and Algorithms

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?

Implement efficient search and sort algorithms for large datasets.

Medium · Coding and Algorithms

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?

Optimize space and time complexity for array manipulation tasks.

Medium · Coding and Algorithms

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?

Stop tag and share joins from fanning out a page

Medium · join fan-out · semi-joins · many-to-many

resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.

Approach

1. Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
2. Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
3. Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
4. Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.

Follow-up

• The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
• A resource can be shared with the same user twice under different permissions. Does your count change, and should it?

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

1. 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.
2. 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.
3. 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.
4. 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?

Design a URL shortener service.

Medium · System Design

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?

Discuss trade-offs in database selection for high-frequency trading platforms.

Medium · System Design

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?

Explain how to ensure horizontal scalability in a distributed backend system.

Medium · System Design

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?

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

1. 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.
2. 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.
3. 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.
4. 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 JPMC candidates report.

Day 1 — Map the JPMC loop

• Write out the reported sequence: Online Assessment, Technical Interviews, Behavioral Interviews, Superday.
• 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 System Design

• Spend the session on System Design, which JPMC 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 3 — Work DSA (Data Structures & Algorithms)

• Spend the session on DSA (Data Structures & Algorithms), which JPMC candidates report being tested on.
• Write one worked example in DSA (Data Structures & Algorithms) and time yourself on it.

Deliverable: One timed worked example in DSA (Data Structures & Algorithms).

Day 4 — Work Java (Programming Language)

• Spend the session on Java (Programming Language), which JPMC candidates report being tested on.
• Write one worked example in Java (Programming Language) and time yourself on it.

Deliverable: One timed worked example in Java (Programming Language).

Day 5 — Answer out loud: Coding and Algorithms

• Answer aloud, timed: Make the entire array contain only distinct elements and return the minimum total cost.
• Answer aloud, timed: Return the sum modulo 10 from an array of integers.

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

Day 6 — Answer out loud: System Design

• Answer aloud, timed: Design a URL shortener service.
• Answer aloud, timed: Discuss trade-offs in database selection for high-frequency trading platforms.

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

Day 7 — Answer out loud: Behavioral and Experience-based

• Answer aloud, timed: Walk through a complex technical challenge you faced in your previous role and how you resolved it.
• Answer aloud, timed: Describe a time you had to manage conflicting project requirements.

Deliverable: Spoken answers to 2 reported Behavioral and Experience-based question(s), under time.

Behavioural preparation

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

Walk through a complex technical challenge you faced in your previous role and how you resolved it.

Medium · Behavioral and Experience-based

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 time you had to manage conflicting project requirements.

Medium · Behavioral and Experience-based

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 ensure code quality during peer reviews?

Medium · Behavioral and Experience-based

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?