cswork / libraryOpen practice workspace

Interview guides · Keyrus France

Keyrus France Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Keyrus France, you do not simply write code in isolation; you act as a technical consultant and problem solver driving digital transformation for diverse clients. Keyrus France is a global player in data, intelligence, and digital experience. In this role, you will design, develop, and modernize software solutions that help businesses harness their data, optimize operations, and create seamless digital experiences for their users. The impact of your work is direct and highly visible. You will contribute to high-stakes initiatives, ranging from major application refactoring projects to building cloud-native architectures from scratch. Whether you are integrated into a client-facing delivery team or working on internal solution accelerators, your engineering decisions will directly influence the agility, security, and scalability of the platforms you build.

This guide is scoped to a Software Engineer candidate at Keyrus France.

Focus areas

  • Technical interview (developer/manager)
  • Coding/Technical tests
  • Java (tests)

The Keyrus France interview process

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

Initial Screening

A brief video or phone call with the Talent Acquisition team to introduce the company and discuss your background.

What to demonstrate

  • A brief video or phone call with the Talent Acquisition team to introduce the company and discuss your background
  • Depth in Technical interview (developer/manager)

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.

HR Interview

An in-depth interview focused on your soft skills, adaptability, and consulting potential.

What to demonstrate

  • An in-depth interview focused on your soft skills, adaptability, and consulting potential
  • Depth in Technical interview (developer/manager)

How to prepare

  • Answer aloud and timed: Describe a scenario where you had to refactor a legacy application. What was your strategy to minimize downtime and avoid regressions?
  • Answer aloud and timed: How do you ensure security best practices are integrated into your continuous integration and continuous deployment (CI/CD) pipelines?

Technical Evaluation

A technical interview with a senior engineer or technical lead, often including a coding test.

What to demonstrate

  • A technical interview with a senior engineer or technical lead, often including a coding test
  • Depth in Technical interview (developer/manager)

How to prepare

  • Answer aloud and timed: What is your approach to optimizing slow-running database queries in a production environment?
  • Answer aloud and timed: Walk me through your solution to a logical puzzle where you have limited data and must find the most efficient path.

Final Interview

A conversation with a Business Unit Manager or Director to discuss project matching and offer details.

What to demonstrate

  • A conversation with a Business Unit Manager or Director to discuss project matching and offer details
  • Depth in Technical interview (developer/manager)

How to prepare

  • Answer aloud and timed: How do you approach debugging a intermittent, non-reproducible bug in a distributed system?
  • Answer aloud and timed: If a client requests a feature that is technically unfeasible within their timeline, how do you propose an alternative logical roadmap?

Where candidates lose points

Structure your project examples

When discussing your past experiences, use the STAR method (Situation, Task, Action, Result). Focus heavily on the Action you took and the tangible Result your engineering choices delivered for the business.

Emphasize your adaptability

Since you will be working as a consultant, highlight your ability to learn new technologies quickly. Share concrete examples of projects where you had to ramp up on a new framework or domain in a short period.

Prepare questions for your interviewers

Show your consulting mindset by asking intelligent questions about their current client challenges, the technologies they are prioritizing, and how they foster continuous learning within the engineering teams.

Questions & practice

How do you manage memory and garbage collection in a high-throughput Java application?

Medium · Technical & Architecture

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?

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

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

Track a rolling failure rate per destination for circuit decisions

Easy · sliding window · ring buffer · circuit breaker

The egress service delivers about 1,500 webhooks per second across roughly 40,000 destinations, each call bounded by a 10 second timeout. Maintain, per destination, the failure rate over the trailing 60 seconds so a caller can ask before dispatch whether the circuit should open. Attempts arrive as (destination_id, finished_at_ms, outcome). Requirement: amortised O(1) per attempt, with total memory bounded by the destination count rather than by traffic. Give the structure, its exact memory, and the rule that stops a destination with three attempts from opening a circuit.

Approach

  1. Name the exact-deque version and then reject it as the default. Holding timestamps and advancing a tail pointer past anything older than now minus 60 seconds is a correct two-pointer window at amortised O(1) per attempt, but its memory tracks in-window traffic, so one destination in a retry storm holds hundreds of thousands of entries while thousands of quiet destinations hold none.
  2. Use a ring of 60 one-second buckets per destination, each bucket a pair of counters for attempts and failures. On an attempt, advance the ring by the elapsed whole seconds, zeroing at most min(elapsed, 60) buckets, then increment the head. That is amortised O(1) with a fixed footprint per destination.
  3. State the footprint: 60 buckets times two 4-byte counters is 480 bytes of payload per destination, so 40,000 destinations is roughly 20 to 25 MB with per-entry overhead, bounded by the catalogue rather than by the rate. The cost is granularity, since the oldest bucket ages out in whole seconds, which is far tighter than the decision needs.
  4. Require a minimum sample before the circuit may open. A destination with three attempts and three failures reads as 100 percent and is not evidence; a floor of roughly 20 attempts in the window makes the ratio meaningful, and below that floor use a run of consecutive failures as the trigger instead.

Follow-up

  • The fleet is 30 instances and each sees roughly a thirtieth of a destination's traffic. Where does the rate actually live, and what does a per-instance answer get wrong?
  • A destination answers in 9.5 seconds and succeeds. It is not failing but it is consuming your per-destination concurrency. What signal should open the circuit here?

Explain why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

  1. Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
  2. For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
  3. Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
  4. Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

  • 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
  • A dashboard runs this for 40 owners in one page load. What changes about the design?

Write the update path that detects a concurrent edit

Medium · optimistic concurrency · transactional outbox · audit history

resource carries version INT NOT NULL DEFAULT 1. resource_revision holds revision_id, resource_id, version, actor_user_id, change_kind, patch JSONB, request_id, created_at with UNIQUE (resource_id, version). outbox_event holds aggregate_type, aggregate_id, aggregate_version, event_type, payload, status. A PUT carries the version the client read. Write the exact statements for the single transaction that applies the edit, records the revision and enqueues 'resource.updated', and give the handler's branch on zero affected rows. Then say what PostgreSQL 16 does under READ COMMITTED when two of these updates hit one row at once.

Approach

  1. One transaction, three writes, no network call inside it: UPDATE resource SET title = $3, version = version + 1, updated_at = now() WHERE resource_id = $1 AND tenant_id = $4 AND version = $2; then INSERT the resource_revision row at version $2 + 1; then INSERT the outbox_event row at the same aggregate_version. The event goes to a table rather than a broker because no transaction spans both.
  2. Branch on the affected-row count before doing anything else. Zero has three causes — stale version, wrong tenant, row gone — so re-read once and map to 409 carrying the current version, or 404 for an id outside the caller's tenant, which also stops the endpoint confirming that another tenant's id exists.
  3. State the engine behaviour instead of assuming it. Under READ COMMITTED the second UPDATE blocks on the row lock, and when the first commits PostgreSQL re-evaluates the WHERE clause against the newly committed row, so the version predicate now fails and the statement reports zero rows. Under REPEATABLE READ the identical collision raises SQLSTATE 40001 instead, so the handler must fold both shapes into one conflict response.
  4. Keep UNIQUE (resource_id, version) even though the predicate already serialises writers. It is what makes a lost update unwritable if any other path ever reaches the revision table, and it converts a logic bug into 23505 rather than into a silently missing history row.

Follow-up

  • A client sends the version it read ten minutes ago and the resource has moved three versions. What is in your 409 so it can resolve the conflict without a full re-fetch?
  • Two editors, two disjoint fields, no overlap. Does your answer still refuse the second write, and should it?

Can you explain the difference between microservices and monolithic architectures, and when you would choose o

Medium · Technical & Architecture

Can you explain the difference between microservices and monolithic architectures, and when you would choose one over the other?

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 a scenario where you had to refactor a legacy application. What was your strategy to minimize downtim

Medium · Technical & Architecture

Describe a scenario where you had to refactor a legacy application. What was your strategy to minimize downtime and avoid regressions?

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 security best practices are integrated into your continuous integration and continuous deplo

Medium · Technical & Architecture

How do you ensure security best practices are integrated into your continuous integration and continuous deployment (CI/CD) pipelines?

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. 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 is your approach to optimizing slow-running database queries in a production environment?

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

Walk me through your solution to a logical puzzle where you have limited data and must find the most efficient

Medium · Logic & Problem-Solving

Walk me through your solution to a logical puzzle where you have limited data and must find the most efficient path.

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?

If a client requests a feature that is technically unfeasible within their timeline, how do you propose an alt

Medium · Logic & Problem-Solving

If a client requests a feature that is technically unfeasible within their timeline, how do you propose an alternative logical roadmap?

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 do you approach debugging a intermittent, non-reproducible bug in a distributed system?

Medium · Logic & Problem-Solving

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. 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 Keyrus France candidates report.

Day 1 — Map the Keyrus France loop

  • Write out the reported sequence: Initial Screening, HR Interview, Technical Evaluation, Final 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 4 reported rounds, with the weakest marked.

Day 2 — Work Technical interview (developer/manager)

  • Spend the session on Technical interview (developer/manager), which Keyrus France candidates report being tested on.
  • Write one worked example in Technical interview (developer/manager) and time yourself on it.

Deliverable: One timed worked example in Technical interview (developer/manager).

Day 3 — Work Coding/Technical tests

  • Spend the session on Coding/Technical tests, which Keyrus France candidates report being tested on.
  • Write one worked example in Coding/Technical tests and time yourself on it.

Deliverable: One timed worked example in Coding/Technical tests.

Day 4 — Work Java (tests)

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

Deliverable: One timed worked example in Java (tests).

Day 5 — Answer out loud: Technical & Architecture

  • Answer aloud, timed: How do you manage memory and garbage collection in a high-throughput Java application?
  • Answer aloud, timed: Can you explain the difference between microservices and monolithic architectures, and when you would choose one over the other?

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

Day 6 — Answer out loud: Logic & Problem-Solving

  • Answer aloud, timed: Walk me through your solution to a logical puzzle where you have limited data and must find the most efficient path.
  • Answer aloud, timed: How do you approach debugging a intermittent, non-reproducible bug in a distributed system?

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

Day 7 — Answer out loud: Behavioral & Motivation

  • Answer aloud, timed: Why do you want to work in a consulting environment like Keyrus France rather than a traditional product company?
  • Answer aloud, timed: Describe a time when you had to work with a difficult stakeholder or client. How did you manage the relationship and deliver the project?

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

Behavioural preparation

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

Why do you want to work in a consulting environment like Keyrus France rather than a traditional product compa

Medium · Behavioral & Motivation

Why do you want to work in a consulting environment like Keyrus France rather than a traditional product company?

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 when you had to work with a difficult stakeholder or client. How did you manage the relationsh

Medium · Behavioral & Motivation

Describe a time when you had to work with a difficult stakeholder or client. How did you manage the relationship and deliver the project?

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?

What are your career aspirations for the next three years, and how does this role help you achieve them?

Medium · Behavioral & Motivation

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 stay updated with emerging technologies, and how have you applied a newly learned tool in your rece

Medium · Behavioral & Motivation

How do you stay updated with emerging technologies, and how have you applied a newly learned tool in your recent work?

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?