cswork / libraryOpen practice workspace

Interview guides · Deutsche Börse Group

Deutsche Börse Group Software Engineer Interview Guide

Deutsche Börse Group Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

As a Software Engineer at Deutsche Börse Group, you play a pivotal role in developing and maintaining critical systems that support the infrastructure of one of the world's largest stock exchanges. This position is key to ensuring the seamless operation of trading systems that serve numerous financial markets across Europe. Your contributions will directly influence the efficiency, reliability, and scalability of trading applications, impacting both users and the broader financial ecosystem. In this role, you will engage with cutting-edge technologies such as C/C++, Java, and MySQL while collaborating with cross-functional teams to solve complex technical challenges. The environment is dynamic and fast-paced, offering you the opportunity to work on high-stakes projects that require innovative problem-solving and technical expertise.

This guide is scoped to a Software Engineer candidate at Deutsche Börse Group.

Focus areas

  • Time Complexity
  • Data Structures
  • Java

The Deutsche Börse Group interview process

Deutsche Börse Group candidates report 3 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Initial Screening Call

First step involves a call to assess your background and fit for the role.

What to demonstrate

  • First step involves a call to assess your background and fit for the role
  • Depth in Time Complexity

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 Interviews

One or more interviews focusing on technical abilities and problem-solving skills.

What to demonstrate

  • One or more interviews focusing on technical abilities and problem-solving skills
  • Depth in Time Complexity

How to prepare

  • Answer aloud and timed: What are the principles of object-oriented programming?
  • Answer aloud and timed: How does garbage collection work in Java?

HR Interview

Final interview assessing cultural fit and alignment with the organization's values.

What to demonstrate

  • Final interview assessing cultural fit and alignment with the organization's values
  • Depth in Time Complexity

How to prepare

  • Answer aloud and timed: Can you discuss a time when you had to debug a complex issue in your code?
  • Answer aloud and timed: Tell me about a time you faced a significant challenge in a project. How did you handle it?

Where candidates lose points

Practice coding challenges

Familiarize yourself with common algorithms and data structures to effectively tackle technical interviews.

Understand company culture

Research Deutsche Börse Group’s values and mission to align your answers with what the company prioritizes.

Prepare for behavioral questions

Reflect on past experiences and how they demonstrate your skills and adaptability.

Questions & practice

How does garbage collection work in Java?

Medium · Technical Questions

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?

How would you approach a situation where you are given an ambiguous problem?

Medium · Problem-Solving Questions

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?

Write a function to reverse a linked list.

Medium · Coding Questions

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?

Explain the time complexity of your solution for a given algorithm.

Medium · Coding Questions

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?

Explain how you would optimize a database query.

Medium · Technical Questions

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?

Find version gaps and relay lag with window functions

Medium · window functions · event tables · frame semantics

outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.

Approach

  1. Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
  2. Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
  3. Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
  4. Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.

Follow-up

  • Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
  • Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?

Describe the differences between a stack and a queue.

Medium · Technical Questions

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?

What are the principles of object-oriented programming?

Medium · Technical Questions

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?

Describe your thought process when tackling a new coding challenge.

Medium · Problem-Solving Questions

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 scalable trading system?

Medium · System Design Questions

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 considerations would you take into account when developing a real-time data processing application?

Medium · System Design Questions

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?

Read latency spikes on a sixty-second sawtooth

Medium · cache stampede · single-flight · ttl

The cached listing read path serves about 14k reads/second at an 85% hit rate. p99 sits at 35 ms for 57 seconds, jumps to 900 ms for 3, and repeats. During each spike the primary shows several hundred identical listing queries starting within the same millisecond, all carrying one large tenant's id. Cache entries use a 60-second TTL. Give the mechanism, the ordered checks, the fix, and the correctness hazard your fix must not introduce.

Approach

  1. Match the period to a configured number before theorising about load. A spike every 60 seconds against a 60-second TTL is an entry expiring, and you confirm it by correlating spike timestamps with the entry's write time rather than with the traffic curve. If the period had matched a cron or a GC interval instead, this is a different investigation.
  2. Establish the concurrency of the miss. Several hundred identical queries in one millisecond means the miss path has no coalescing: every request that arrives between expiry and repopulation recomputes. The herd size is that key's arrival rate times its recompute time, so at 1.2k reads/second for the hot key and a 250 ms recompute you expect about 300 concurrent misses, which matches what is observed.
  3. Add single-flight on the miss path so one caller per key recomputes under a short-lived lock while the rest wait for its result. Prefer stale-while-revalidate where the read tolerates it: return the expired value immediately and refresh asynchronously, which removes the latency spike rather than serialising it into a queue of waiters.
  4. De-synchronise the keys. Write TTLs with jitter, for example 60 seconds plus or minus 10%, so a deploy or a mass invalidation does not align every key on the same second and turn a per-key herd into a fleet-wide one.

Follow-up

  • The same sawtooth appears on a key that is invalidated on write rather than expired. Is that the same bug?
  • How does your answer change if the recompute takes 4 seconds instead of 250 ms?

Suggested practice checklist

Built from the rounds and topics Deutsche Börse Group candidates report.

Day 1 — Map the Deutsche Börse Group loop

  • Write out the reported sequence: Initial Screening Call, Technical Interviews, HR 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 Time Complexity

  • Spend the session on Time Complexity, which Deutsche Börse Group candidates report being tested on.
  • Write one worked example in Time Complexity and time yourself on it.

Deliverable: One timed worked example in Time Complexity.

Day 3 — Work Data Structures

  • Spend the session on Data Structures, which Deutsche Börse Group 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 Java

  • Spend the session on Java, which Deutsche Börse Group candidates report being tested on.
  • Write one worked example in Java and time yourself on it.

Deliverable: One timed worked example in Java.

Day 5 — Answer out loud: Technical Questions

  • Answer aloud, timed: Describe the differences between a stack and a queue.
  • Answer aloud, timed: Explain how you would optimize a database query.

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

Day 6 — Answer out loud: Behavioral Questions

  • Answer aloud, timed: Tell me about a time you faced a significant challenge in a project. How did you handle it?
  • Answer aloud, timed: Where do you see yourself in five years?

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

Day 7 — Answer out loud: Problem-Solving Questions

  • Answer aloud, timed: How would you approach a situation where you are given an ambiguous problem?
  • Answer aloud, timed: Describe your thought process when tackling a new coding challenge.

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

Behavioural preparation

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

Can you discuss a time when you had to debug a complex issue in your code?

Medium · Technical Questions

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 me about a time you faced a significant challenge in a project. How did you handle it?

Medium · Behavioral Questions

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?

Where do you see yourself in five years?

Medium · Behavioral Questions

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 situation where you had to work collaboratively with a difficult colleague.

Medium · Behavioral Questions

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?