Interview guides · Contrader

Contrader Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Contrader, you are joining a dynamic, talent-oriented team that emphasizes both technical rigor and collaborative problem-solving. This role is central to the company’s ability to deliver high-quality solutions, often involving direct engagement with complex logic and modern software development practices. You will be expected to contribute to the lifecycle of projects that range from core development to specialized technical implementation, making this a high-visibility role for those who thrive in fast-paced environments. The position is particularly critical for candidates who enjoy a mix of individual technical contribution and group dynamics.

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

Focus areas

Teamwork / Team Working
Problem Solving
Java

The Contrader interview process

Contrader candidates report 2 rounds over 2-4 weeks. The stages below are what candidates describe, not a published process.

Remote Screening

Initial assessment via a platform like Teams to evaluate interest, background, and motivation.

What to demonstrate

Initial assessment via a platform like Teams to evaluate interest, background, and motivation
Depth in Teamwork / Team Working

How to prepare

Answer aloud and timed: Can you explain the fundamental principles of Object-Oriented Programming (OOP)?
Answer aloud and timed: What are the primary differences between HTML, CSS, and Java in a web application context?

Onsite Assessment

Multi-day assessment at Benevento headquarters testing technical skills, logical reasoning, and teamwork.

What to demonstrate

Multi-day assessment at Benevento headquarters testing technical skills, logical reasoning, and teamwork
Depth in Teamwork / Team Working

How to prepare

Answer aloud and timed: How do you approach query optimization or table structure in SQL?
Answer aloud and timed: Can you describe a design pattern you have used and why it was the right choice for that scenario?

Where candidates lose points

Own your background

Be prepared to talk about your university thesis or specific personal projects in detail. The interviewers appreciate passion and depth.

Practice logic puzzles

While you cannot predict the exact puzzle, practicing general deductive reasoning will make you feel more comfortable during the group assessment.

Be clear about relocation

Since the company operates out of Benevento, be explicit about your willingness to relocate or commute.

Ask questions

Use the interview to ask about the company’s projects and the team’s culture. It shows you are genuinely interested in the role.

Questions & practice

Explain how you break down a large, ambiguous requirement into smaller, actionable technical tasks.

Medium · Logic and Problem-Solving

Approach

Restate the input: its shape, its size, and what is guaranteed about it.
Name the brute-force solution and its complexity before improving on it.
Choose the data structure from the access pattern, not from familiarity.
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?

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

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.
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.
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.
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?

Archive a resource graph without breaking live references or recursing

Medium · graph traversal · topological order · tenant isolation

Resources reference other resources within a tenant; for the largest tenant the reference table holds up to 2,000,000 nodes and 8,000,000 edges. Archiving a resource must archive everything reachable from it that nothing outside the set still references, refuse when a live external referrer exists, and terminate when references form cycles, which they legitimately do. Produce the archive order and the refusal list, targeting O(V+E). Say what stops the traversal crossing a tenant boundary, and why recursion is the wrong control structure at this size.

Approach

Load the subgraph with the tenant predicate on both endpoints of the edge, not only on the side you started from. Scoping the left table alone is the classic cross-tenant leak: one mis-entered edge then pulls another tenant's resources into the traversal and, worse, into the archive.
Traverse iteratively with an explicit stack. A 2,000,000-node graph can hold a chain deep enough to exhaust a native stack in the low tens of thousands of frames, and that failure is a process crash rather than an error you can return.
Treat cycles as data rather than corruption: compute strongly connected components with Tarjan in O(V+E) using its own explicit stack, then condense. The condensation is a DAG, so a topological order over it gives the archive order, and every member of a component archives in one transaction because no order within a cycle is valid.
Decide refusals with reverse edges. A candidate is archivable only if every in-edge originates inside the candidate set, so build the transpose or count in-degrees restricted to the visited set, and emit each blocked resource with the id of the external referrer, which is the only part of the answer an operator can act on.

Follow-up

The graph is read in one query and the archive writes a minute later. What can change in between, and how do you make the write safe?
The candidate set is 400,000 resources. Is that one transaction, and if not, what does a half-finished archive look like to a reader?

How do you approach query optimization or table structure in SQL?

Medium · Technical Foundations

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?

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

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.
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.
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.
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?

Can you explain the fundamental principles of Object-Oriented Programming (OOP)?

Medium · Technical Foundations

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?

What are the primary differences between HTML, CSS, and Java in a web application context?

Medium · Technical Foundations

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?

Can you describe a design pattern you have used and why it was the right choice for that scenario?

Medium · Technical Foundations

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?

How would you approach a logic puzzle that requires elimination or deduction?

Medium · Logic and Problem-Solving

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?

If you were tasked with solving a complex problem in a group setting, what is your strategy for delegating tas

Medium · Logic and Problem-Solving

If you were tasked with solving a complex problem in a group setting, what is your strategy for delegating tasks?

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?

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

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.
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.
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.
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 Contrader candidates report.

Day 1 — Map the Contrader loop

Write out the reported sequence: Remote Screening, Onsite Assessment.
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 2 reported rounds, with the weakest marked.

Day 2 — Work Teamwork / Team Working

Spend the session on Teamwork / Team Working, which Contrader candidates report being tested on.
Write one worked example in Teamwork / Team Working and time yourself on it.

Deliverable: One timed worked example in Teamwork / Team Working.

Day 3 — Work Problem Solving

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

Deliverable: One timed worked example in Problem Solving.

Day 4 — Work Java

Spend the session on Java, which Contrader 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 Foundations

Answer aloud, timed: Can you explain the fundamental principles of Object-Oriented Programming (OOP)?
Answer aloud, timed: What are the primary differences between HTML, CSS, and Java in a web application context?

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

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

Answer aloud, timed: How would you approach a logic puzzle that requires elimination or deduction?
Answer aloud, timed: If you were tasked with solving a complex problem in a group setting, what is your strategy for delegating tasks?

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

Day 7 — Answer out loud: Behavioral and Teamwork

Answer aloud, timed: Why are you interested in starting your career or continuing your growth at Contrader?
Answer aloud, timed: Can you describe a situation where you had to work with a team of people you didn't know to solve a problem?

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

Behavioural preparation

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

What is your experience with specific frameworks, and how do they impact development speed?

Medium · Technical Foundations

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?

Why are you interested in starting your career or continuing your growth at Contrader?

Medium · Behavioral and Teamwork

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?

Can you describe a situation where you had to work with a team of people you didn't know to solve a problem?

Medium · Behavioral and Teamwork

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?

How do you handle feedback on your code or your approach to a problem?

Medium · Behavioral and Teamwork

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?