Interview guides · Brooksource

Brooksource Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer working with Brooksource, you are a critical link in the delivery of high-impact technical solutions for a diverse portfolio of Fortune 500 clients. Unlike traditional direct-hire roles, this position demands a unique blend of technical agility and professional adaptability. You are not just writing code; you are integrating into established engineering teams to solve complex business problems, modernize legacy systems, or build scalable features that directly influence client success. The role requires a high degree of versatility. Because Brooksource partners with various industry leaders, you may find yourself contributing to anything from mission-critical backend infrastructure to user-facing frontend applications.

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

Focus areas

Java
Object-Oriented Programming (OOP)
Java Garbage Collection

The Brooksource interview process

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

Phone Screen

Initial call with a Brooksource recruiter to gauge your background, interests, and career goals.

What to demonstrate

Initial call with a Brooksource recruiter to gauge your background, interests, and career goals
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.

Formal Interview

A more formal interview via video call that may include technical screenings or assessments.

What to demonstrate

A more formal interview via video call that may include technical screenings or assessments
Depth in Java

How to prepare

Answer aloud and timed: Describe your experience with the Software Development Life Cycle.
Answer aloud and timed: What are your primary career goals, and how does this role fit into them?

Client Interview

Final interview with the client's hiring team to evaluate your ability to contribute to their project requirements.

What to demonstrate

Final interview with the client's hiring team to evaluate your ability to contribute to their project requirements
Depth in Java

How to prepare

Answer aloud and timed: Tell me about a project you are particularly proud of and your specific role in it.
Answer aloud and timed: Explain the core principles of OOP (Object-Oriented Programming).

Where candidates lose points

Own your story

Be ready to explain why you want to move into a contract role and how your specific background makes you a perfect fit for the client's needs.

Prepare your environment

For video interviews, ensure your camera, microphone, and internet connection are tested beforehand. Professionalism in your setup reflects your attention to detail.

Do your homework

Research the client company if the recruiter shares the name. Understanding their industry and primary product will make you stand out.

Be concise

Especially in the initial behavioral screens, keep your answers structured and to the point. Respect the recruiter's time.

Questions & practice

How does Java Garbage Collection work?

Medium · Technical Foundations

Approach

Say what the runtime actually does before reasoning about the code.
Name what is shared across threads and what owns each piece of state.
Identify the window where an invariant is briefly untrue.
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?

Canonicalise a request body into a stable idempotency fingerprint

Medium · parsing · canonicalisation · hashing

idempotency_key.request_fingerprint is a SHA-256 over the method, path and canonicalised body, and a retry whose fingerprint differs must be rejected with 422 rather than served the stored response. Write the canonicaliser. Bodies are JSON up to 256 KB nested at most 32 levels; clients vary key order, whitespace and unicode escaping, and some send 64-bit ids as JSON numbers. Produce a deterministic byte string such that semantically identical bodies match and any semantic difference does not. State your complexity and name two normalisations you refuse to perform.

Approach

Parse once into a tree, then re-serialise under fixed rules: object keys sorted, array order preserved, one escaping convention, no insignificant whitespace. Parsing is O(n) and sorting keys is O(k log k) per object, so O(n log n) overall with O(depth) stack, and the 32-level cap is enforced during parsing because hostile nesting is how a canonicaliser becomes a stack overflow.
Sort keys by their UTF-8 bytes and say why the obvious implementation is wrong in some runtimes: a default string comparison that orders by UTF-16 code units places surrogate pairs, meaning code points from U+10000 up, below U+E000 to U+FFFF, which is not UTF-8 byte order, so two services written in different languages disagree on the same document.
Do not re-encode numbers through a double. IEEE-754 binary64 represents integers exactly only up to 2^53, so normalising a 19-digit id through a float changes it, and 1 against 1.0 cannot be reconciled without deciding whether they are the same value. Preserve the literal token, and require ids as strings at the API boundary if you want them comparable.
Reject duplicate keys rather than picking one. JSON permits them and parsers disagree, most keeping the last, so any choice you make ties the fingerprint to a parser detail that the code handling the request does not necessarily share.

Follow-up

A client sends the same logical request with an extra field your API ignores. Same key, different fingerprint, so you return 422. Is that the right answer?
Where does the fingerprint get computed relative to request decompression and the body-size limit?

Identify the heaviest tenants in a five-minute window under memory pressure

Medium · top-k · heavy hitters · streaming

The edge service handles about 3,000 requests per second across roughly 50,000 tenants, peaking near 9,000. Expose the 50 heaviest tenants by request count over the trailing five minutes so limits can be tightened before one tenant's backfill starves the fleet. You may not retain five minutes of raw records. Give the exact solution and its memory, then the bounded-memory approximation with its error stated as a formula, and say which you would ship and at what tenant cardinality that choice changes.

Approach

Do the exact version first, because it is affordable at this cardinality: a ring of 300 one-second counters per tenant, advanced lazily, is 1,200 bytes of counters per tenant and roughly 60 to 90 MB for 50,000 tenants with overhead. Carry a running total and subtract the bucket you overwrite so a window read is O(1) rather than 300 adds.
Extract the top 50 with a size-k min-heap over the tenant sums: O(d log k) for d tenants, against O(d log d) to sort them all. Maintaining the heap continuously instead of on query requires a tenant-to-heap-index map, because incrementing a count already inside the heap means sifting from a known position, and without that map you rebuild the heap on every request.
State the approximation precisely rather than gesturing at sketches. Misra-Gries with m counters retains every item whose true count exceeds N/(m+1), and each retained count underestimates the truth by at most N/(m+1). With m = 1,000 and N = 900,000 requests in the window the error is roughly 900 requests, which is fine for spotting a tenant sending 50,000 and useless for ranking two tenants 200 apart.
Say what breaks when the window slides: Misra-Gries and Space-Saving are insert-only and cannot be decremented as records age out. The workable construction is one summary per sub-window, say ten seconds, with 30 summaries merged at query time, and the merged error is the sum of the per-summary errors, so the bound degrades linearly in the number of sub-windows.

Follow-up

The heaviest tenant is heavy because of one export job rather than user traffic. Should the limiter treat those as the same tenant?
Two tenants sit tied at the boundary of the top 50. Does your answer flap, and does the flapping matter?

Can you explain the difference between a primary key and a foreign key 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?

Explain the core principles of OOP (Object-Oriented Programming).

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 do you ensure your code is maintainable and scalable?

Medium · Technical Foundations

Approach

Fix the scope first: who calls this, how often, and what they do when it fails.
Name the read and write paths separately; they rarely have the same bottleneck.
Choose a partition key and say what query it makes expensive.
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 is your process for debugging a complex issue in a production environment?

Medium · Technical Foundations

Approach

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

Day 1 — Map the Brooksource loop

Write out the reported sequence: Phone Screen, Formal Interview, Client 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 Java

Spend the session on Java, which Brooksource 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 Object-Oriented Programming (OOP)

Spend the session on Object-Oriented Programming (OOP), which Brooksource candidates report being tested on.
Write one worked example in Object-Oriented Programming (OOP) and time yourself on it.

Deliverable: One timed worked example in Object-Oriented Programming (OOP).

Day 4 — Work Java Garbage Collection

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

Deliverable: One timed worked example in Java Garbage Collection.

Day 5 — Answer out loud: Behavioral & Background

Answer aloud, timed: Tell me about a time you had to learn a new technology on the fly.
Answer aloud, timed: How do you handle disagreements with a team member regarding a technical approach?

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

Day 6 — Answer out loud: Technical Foundations

Answer aloud, timed: Explain the core principles of OOP (Object-Oriented Programming).
Answer aloud, timed: How does Java Garbage Collection work?

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

Day 7 — Dry run for Brooksource

Run one full mock under time, then write down the two questions you most want to ask your interviewers.

Deliverable: A completed timed mock and two questions to ask.