Nomura Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at Nomura, you will sit at the intersection of high-frequency finance and cutting-edge technology. Your work is critical to maintaining the firm’s competitive edge, whether you are building resilient trading platforms, optimizing global middle-office infrastructure, or developing scalable applications for risk management and electronic trading. You are not just writing code; you are building the digital backbone that enables Nomura to execute complex financial transactions with speed, accuracy, and security. This role requires a unique balance of technical rigor and a deep interest in the financial domain. You will collaborate with traders, risk analysts, and fellow engineers to solve high-stakes problems where system reliability and performance are non-negotiable.

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

Focus areas

• Java
• SQL
• System Design

The Nomura interview process

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

Initial Screening

The process begins with an initial screening to assess your qualifications and fit for the role.

What to demonstrate

• The process begins with an initial screening to assess your qualifications and fit for the role
• Depth in Java

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

You will undergo technical assessments to evaluate your coding skills and problem-solving abilities.

What to demonstrate

• You will undergo technical assessments to evaluate your coding skills and problem-solving abilities
• Depth in Java

How to prepare

• Answer aloud and timed: Describe the internal workings of React state management (e.g., Redux or Flux workflow).
• Answer aloud and timed: How would you optimize a slow SQL query? Explain your approach to indexing and sharding.

Project Discussions

Deep-dive discussions about your previous projects to understand your experience and contributions.

What to demonstrate

• Deep-dive discussions about your previous projects to understand your experience and contributions
• Depth in Java

How to prepare

• Answer aloud and timed: What are the differences between Relational and No-SQL databases, and when would you choose one over the other?
• Answer aloud and timed: How would you design a system to handle trade reconciliation issues?

Management-Level Interviews

Interviews with management to assess your fit within the team and company culture.

What to demonstrate

• Interviews with management to assess your fit within the team and company culture
• Depth in Java

How to prepare

• Answer aloud and timed: Explain how you would architect a service to handle high-frequency data ingestion.
• Answer aloud and timed: Given a requirement for a new feature, how do you decide on the appropriate architectural approach?

Final Decision-Making

The final stage involves decision-making based on all previous interviews and assessments.

What to demonstrate

• The final stage involves decision-making based on all previous interviews and assessments
• Depth in Java

How to prepare

• Answer aloud and timed: How do you ensure high availability and fault tolerance in your service design?
• Answer aloud and timed: Describe a time you faced a significant technical challenge; how did you resolve it?

Where candidates lose points

Own your resume

Every project listed is fair game. Be prepared to go into extreme detail regarding the implementation, the challenges faced, and the final outcomes of every project you mention.

Clarify before answering

If a question seems ambiguous, ask for clarification. It shows that you value precision and are thinking about edge cases before you start building or answering.

Prepare for the "Why

Nomura interviewers care about your decision-making. Whenever you describe a solution, mention why you chose that approach over alternatives.

Stay calm under pressure

If an interviewer challenges your answer, treat it as a discussion rather than a confrontation. Defend your logic calmly, or acknowledge the scenario if they point out a valid edge case you missed.

Questions & practice

How do you handle concurrency and multithreading in Java to prevent race conditions?

Medium · Technical and Domain Fundamentals

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?

Collapse a redelivered event batch into per-aggregate high-water marks

Easy · hashing · at-least-once · aggregation

You drain a batch of up to 5,000,000 events, each (aggregate_id BIGINT, aggregate_version INT, event_type, payload). The log guarantees order within one aggregate only; the batch merges 64 partitions, and a relay failover has redelivered a range, so an older version for an aggregate can appear after a newer one. Given a map of last_applied_version per aggregate, produce the events worth applying, at most one per (aggregate_id, version), plus the count discarded. Target O(n) time. State the memory for 2,000,000 distinct aggregates and what you do when it does not fit.

Approach

1. One pass, one hash map from aggregate_id to the highest version kept, and a discard counter. An event whose version is at or below last_applied_version for its aggregate is dropped without further work, which is the whole reason the event carries its version rather than a delta. O(n) expected time, O(d) space in distinct aggregates.
2. Keep the maximum, never the last occurrence. The redelivered range means the final appearance of an aggregate in the batch can be an older version than one seen earlier in the same batch, so last-wins applies stale state over newer state and the projection regresses with no error anywhere.
3. Cost the memory instead of calling it large: an 8-byte key plus a 4-byte version is 12 bytes of payload, and an open-addressed table held at a 0.7 load factor costs roughly 17 bytes per entry before per-slot metadata, so 2,000,000 aggregates is tens of megabytes in a native layout and several times that in a runtime that boxes both key and value.
4. If the distinct set exceeds memory, partition on hash(aggregate_id) mod P and reduce each partition independently. Every event for one aggregate hashes to the same partition, so the per-partition result is exact and the merge is concatenation rather than a second reduction.

Follow-up

• The payload is a patch rather than a snapshot, so applying only the highest version loses the intermediate changes. What changes in your reduction?
• How do you detect that version 7 arrived while version 6 was never delivered, and what should the consumer do about the gap?

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? Explain your approach to indexing and sharding.

Medium · Technical and Domain Fundamentals

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?

What are the differences between Relational and No-SQL databases, and when would you choose one over the other

Medium · Technical and Domain Fundamentals

What are the differences between Relational and No-SQL databases, and when would you choose one over the other?

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 REST APIs and other communication protocols in a microservices architecture.

Medium · Technical and Domain Fundamentals

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 the internal workings of React state management (e.g., Redux or Flux workflow).

Medium · Technical and Domain Fundamentals

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 a system to handle trade reconciliation issues?

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

Explain how you would architect a service to handle high-frequency data ingestion.

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

Given a requirement for a new feature, how do you decide on the appropriate architectural approach?

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

How do you ensure high availability and fault tolerance in your service design?

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

Every query on one table stalls for forty seconds mid-deploy

Medium · lock contention · ddl · migrations

During a release on PostgreSQL, every query touching resource times out for about 40 seconds and then recovers with no intervention. The release ran one migration, ALTER TABLE resource ADD COLUMN archived_reason TEXT, and the migration log shows it completing in 6 ms. Unrelated tables showed no change in error rate. Explain how a 6 ms statement caused a 40-second stall, give the ordered checks you would run on a live system to confirm it, and give the migration procedure that prevents a repeat.

Approach

1. Separate the statement's duration from the lock's duration. ADD COLUMN with no default is a catalogue-only change and genuinely runs in milliseconds, but it requires ACCESS EXCLUSIVE, and it cannot acquire that until every transaction already touching the table has finished.
2. Account for the queueing, which is the part that surprises people. A lock request that is waiting blocks later requests for conflicting modes behind it rather than letting them overtake, so one long-open transaction holds the DDL and the DDL holds all the traffic. The stall length is set by the longest open transaction, not by the size of the change.
3. Confirm on a live system in this order: pg_stat_activity for that table ordered by xact_start, looking for the oldest transaction and specifically for state = idle in transaction; then pg_locks where granted = false to find the waiter; then join them on pid to name blocker and blocked. pg_blocking_pids() does that join for you and is the fastest single call.
4. Prevent rather than merely time it better. Set lock_timeout to a second or two on the migration session so the DDL abandons the queue after a bounded wait and is retried, instead of holding it for as long as the oldest transaction lives. Be exact about what that buys: queries arriving during the wait still queue behind the pending ACCESS EXCLUSIVE request, so each attempt costs them up to one lock_timeout of added latency. The outage goes from 40 seconds to about one second per attempt, not to zero. Also run migrations away from deploy-time peaks, and put a statement timeout and an idle-in-transaction timeout on the analytics role that opens the long transactions.

Follow-up

• The same release also wants NOT NULL on that column. What is the sequence that gets there without a long lock?
• Your lock_timeout retry fails ten times in a row because the analytics transaction is always open. What do you change?

Suggested practice checklist

Built from the rounds and topics Nomura candidates report.

Day 1 — Map the Nomura loop

• Write out the reported sequence: Initial Screening, Technical Assessments, Project Discussions, Management-Level Interviews, Final Decision-Making.
• 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 5 reported rounds, with the weakest marked.

Day 2 — Work Java

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

Deliverable: One timed worked example in Java.

Day 3 — Work SQL

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

Deliverable: One timed worked example in SQL.

Day 4 — Work System Design

• Spend the session on System Design, which Nomura 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 and Domain Fundamentals

• Answer aloud, timed: Explain the difference between REST APIs and other communication protocols in a microservices architecture.
• Answer aloud, timed: How do you handle concurrency and multithreading in Java to prevent race conditions?

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

Day 6 — Answer out loud: System Design and Architecture

• Answer aloud, timed: How would you design a system to handle trade reconciliation issues?
• Answer aloud, timed: Explain how you would architect a service to handle high-frequency data ingestion.

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

Day 7 — Answer out loud: Behavioral and Situational

• Answer aloud, timed: Describe a time you faced a significant technical challenge; how did you resolve it?
• Answer aloud, timed: How do you prioritize tasks when you have two projects due at the same time?

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

Behavioural preparation

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

Describe a time you faced a significant technical challenge; how did you resolve it?

Medium · Behavioral and Situational

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 prioritize tasks when you have two projects due at the same time?

Medium · Behavioral and Situational

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?

Tell us about a time you disagreed with a teammate on a technical implementation. How did you reach a resoluti

Medium · Behavioral and Situational

Tell us about a time you disagreed with a teammate on a technical implementation. How did you reach a resolution?

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?

Why do you want to work for Nomura, and what do you understand about our role in the financial market?

Medium · Behavioral and Situational

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?