As a Software Engineer at ACA Compliance Group, you play a vital role in building and scaling the industry's leading governance, risk, and compliance (GRC) technology platform. Your work directly empowers top-tier financial institutions to navigate complex regulatory environments, automate risk detection, and manage critical surveillance and testing modules. By developing cloud-native microservices, real-time data pipelines, and API-first services, you ensure that our products remain secure, flexible, and performant at scale. What makes this role uniquely compelling is ACA Compliance Group’s distinct User/Provider Model. Our technology is not only deployed to external clients but is also used internally across our managed services and advisory practices. This creates a powerful feedback loop where every feature, enhancement, and optimization you build is grounded in firsthand operational experience. You will collaborate closely with product managers, compliance experts, and cross-functional engineering teams to solve high-impact problems at the intersection of finance, technology, and artificial intelligence. Expect an environment that values curiosity, technical rigor, and a deep understanding of the "why" behind the business as much as the "how" behind the code.
Recruiter Screen
reportedInitial conversation to align on logistics, role expectations, and high-level background.
What to demonstrate
- Initial conversation to align on logistics, role expectations, and high-level background
- Depth in Infrastructure as Code (IaC)
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 Screen
reportedAssessment involving coding or deep dive into past projects, focusing on relevant tech stack.
What to demonstrate
- Assessment involving coding or deep dive into past projects
- Focusing on relevant tech stack
How to prepare
- Answer aloud and timed: Assess your ability to design scalable, secure, and maintainable software systems. How would you design a cloud-native, globally distributed software solution for scale and flexibility? How do you identify compliance concerns using quantitative methods within system data? What architectural patterns would you use to ensure fault tolerance in an AWS-native environment?
- Answer aloud and timed: Explore your collaboration style, professional history, and alignment with company expectations. Tell me about a time you had a conflict with a coworker and how you resolved it. Why do you want to work for ACA Compliance Group, and why should we hire you? How do you handle ambiguous requirements or pushback from stakeholders on a project?
Super Day Interviews
reportedBack-to-back interviews with engineering leads, product managers, and potential peers covering system design and behavioral questions.
What to demonstrate
- Back-to-back interviews with engineering leads, product managers, and potential peers covering system design and behavioral questions
- Depth in Infrastructure as Code (IaC)
How to prepare
- Work Infrastructure as Code (IaC) until you can explain it without notes
- Work SQL until you can explain it without notes
PracHub editorial advice for the preparation topics above.
Communicate your thought process clearly
When working through coding or design prompts, verbalize your assumptions and reasoning, as interviewers care deeply about how you approach problem-solving.
Brush up on fundamental SQL
Do not overlook database fundamentals; simple outer joins and data retrieval queries frequently appear in technical screens.
Modularize your code
Write clean, modular functions rather than monolithic blocks, and be ready to discuss your preference for loop structures and syntax conventions.
Show genuine interest in the domain
Research the governance, risk, and compliance space so you can speak intelligently about why building software for financial institutions is uniquely challenging and rewarding.
Prepare for behavioral depth
Be ready to discuss past team conflicts and professional achievements with honesty and self-awareness, as behavioral alignment carries significant weight in final evaluations.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Test your fundamental programming capabilities, language fluency, and core computer science concepts. Can you
Test your fundamental programming capabilities, language fluency, and core computer science concepts. Can you explain basic Object-Oriented Programming principles, preferably using Java or C#? Write a basic algorithm to find the frequency of elements in an array. How would you structure this logic into modular functions rather than a single monolithic block? What is the difference between various loop structures, such as using strict inequalities versus inclusive bounds, and when does it matter?
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?
Find overlapping job attempts and peak concurrency from lease records
A day of job_run history yields about 50,000,000 attempt records: (job_run_id, job_type, attempt, started_at, finished_at which is NULL when the worker died, lease_expires_at). Leases expire on a clock, so a job that outran its lease ran twice. Produce (a) every job_run_id whose attempts overlapped in wall-clock time and (b) the peak number of simultaneously running attempts per job_type with the minute it occurred. Target O(n log n). State how you treat a NULL finished_at and what clock skew does to your answer.
Approach
- Define the interval before sorting anything: an attempt occupies [started_at, COALESCE(finished_at, lease_expires_at)). finished_at is observed and lease_expires_at is only a promise, so every attempt without a finish contributes an estimate and the whole result is a lower bound on overlap rather than an exact count.
- For peak concurrency, sweep: emit 2n endpoints, sort by (timestamp, kind) with ends ordered before starts at equal timestamps, then walk the sequence maintaining a counter per job_type and record each type's maximum with its timestamp. O(n log n) dominated by the sort, O(n) space, or O(1) extra if the sort is external and the walk streams.
- For overlap detection, do not compare attempts pairwise. A single global sort by (job_run_id, started_at) gives both the grouping and the order; within a group, keep the maximum end seen so far and report an overlap exactly when the next start is less than that running maximum, which is one linear pass after the sort.
- Half-open intervals matter and are easy to get wrong: with closed intervals an attempt ending at the same millisecond another begins reads as concurrency two, and across 50,000,000 records that artefact swamps the real signal.
Follow-up
- A handler is not idempotent and you have found 400 overlapping jobs. Which of them actually caused damage, and what would you query to find out?
- Peak concurrency for one job_type is 4 against a configured cap of 4. Is the cap working, or is the data hiding attempts that never started?
Canonicalise a request body into a stable idempotency fingerprint
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?
Evaluate your ability to write efficient queries and manage data relationships. Write a basic SQL script using
Evaluate your ability to write efficient queries and manage data relationships. Write a basic SQL script using joins to extract compliance-related data across multiple tables. How would you construct an outer join to handle missing records in a reporting dataset? What considerations do you make when optimizing database queries for performance?
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?
Denormalise tenant onto revisions and backfill it live
resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.
Approach
- Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
- Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
- Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
- Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.
Follow-up
- The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
- How do you verify the backfill actually finished, given rows are still being inserted while it runs?
Assess your ability to design scalable, secure, and maintainable software systems. How would you design a clou
Assess your ability to design scalable, secure, and maintainable software systems. How would you design a cloud-native, globally distributed software solution for scale and flexibility? How do you identify compliance concerns using quantitative methods within system data? What architectural patterns would you use to ensure fault tolerance in an AWS-native environment?
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?
Keep one unresponsive destination from stalling all webhook delivery
Egress delivery sends about 1.5k webhooks/second to 40k destinations, with a per-destination concurrency cap of 4 and a 10-second connect-plus-read timeout. One destination begins accepting connections and never responding; within the hour 150 destinations behave the same way. Design the delivery path so unrelated destinations are unaffected: the pool structure, the timeouts, the retry policy, the per-destination circuit, and what is recorded so a retry is not a second effect at the receiver. State how many in-flight slots the degraded destinations hold and why that number decides the design.
Approach
- Start with the number, and with the law that produces it. In-flight work is arrival rate times time in service, so 1.5k/second against a healthy 200 ms response needs about 300 concurrent slots. Per destination the same product applies, ceilinged by the concurrency cap: at the fleet average of 0.0375 deliveries/second per destination (1.5k spread over 40k) a 10-second timeout is 0.375 slots. A destination that has queued retries behind it is a different regime - every slot refills the instant an attempt expires, so it sits pinned at its cap of 4 - and 150 of those hold 600 slots, more than a pool sized for healthy traffic, entirely consumed by endpoints that will never answer. The per-destination cap bounds one endpoint and says nothing about the aggregate, which is exactly why it alone is not containment.
- Contain with bulkheads and an admission bound rather than a larger pool. Cap total in-flight per pool and shard destinations across pools by a hash of destination id, so a correlated group - one provider, one region - cannot exceed its pool's share. A delivery refused admission and re-queued with backoff is strictly better than one holding a slot on behalf of a receiver that is not listening.
- Treat the timeout as two timeouts, and be exact about what shortening one buys. Connect and read are separate failures and both must be shorter than the budget of whatever is waiting. Occupancy is min(cap, arrival rate x timeout), so dropping the read ceiling from 10 seconds to 3 cuts a merely slow destination's occupancy proportionally, 0.375 slots to 0.11 at the fleet average. It does not cut the 4 slots held by one of the 150: a destination with a retry backlog arrives far above cap/timeout - 0.4/second at a 10-second timeout, 1.33/second at 3 - so it stays pinned at the cap either way and only the slot-seconds per attempt fall. What that does buy is detection rate: 3.3x more failures observed per second on the same four slots, which is how fast the circuit reaches its threshold. Pick the value from the measured latency distribution of successful deliveries, with their high percentile as the floor, not from a round number.
- Add a circuit per destination, counting a timeout as a failure. Once open, fail fast without taking a slot - that is the whole point, converting 4 held slots into zero. Half-open on a schedule with exactly one probe and close only if the probe succeeds, so a permanently dead endpoint costs one request per interval instead of a growing retry queue.
Follow-up
- The destination is not dead - it answers in 9.5 seconds with a 200. Does a failure-rate circuit open? Should anything shed that traffic, and on what signal?
- One destination requires deliveries in order. What does a per-destination concurrency of 4 do to that guarantee, and what would you change to offer it?
One log partition stops advancing while the others drain
Search results for a subset of tenants are hours stale; the rest are current. The projection consumer reports lag of zero on 15 of 16 partitions and 400,000 on one. Its error rate is flat and its CPU is idle. outbox_event has no pending rows older than a second, so the relay has published everything it holds. Identify the mechanism, give the ordered checks, and state what you do in the first ten minutes versus what you change permanently.
Approach
- Read the lag distribution first. A slow consumer lags everywhere; zero on fifteen partitions and 400,000 on one is not throughput. Idle CPU on the stuck partition means the consumer is not advancing its offset at all, which points at one message it cannot get past rather than at a rate problem.
- Exonerate the producer before touching the consumer. No pending outbox rows older than a second means the relay published, so the event exists in the log. This separates never sent from sent and never applied, which are different code paths and usually different owners.
- Read the message at the stuck offset and the handler's log lines for its event_id. A flat error rate with no progress has two explanations and you must distinguish them: the handler is throwing and the retry loop is swallowing it, or the handler is blocking on something and never returning. Idle CPU with no error lines favours the second.
- Mitigate before diagnosing further. Move the offending event to a dead-letter store and commit the offset past it. Adding consumers does nothing here, because a partition is consumed by exactly one member of the group, and the blast radius is every aggregate hashed to that partition, not only the aggregate that produced the bad event.
Follow-up
- The dead-lettered event carried aggregate_version 7 and the projection had applied 6. What must the replay do differently if 8 and 9 landed in the meantime?
- How do you show staleness to the user while the partition is behind, given the API already returns the projection's watermark?
Built from the rounds and topics ACA Compliance Group candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the ACA Compliance Group loop
- Write out the reported sequence: Recruiter Screen, Technical Screen, Super Day Interviews.
- 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.
02Work Infrastructure as Code (IaC)
- Spend the session on Infrastructure as Code (IaC), which ACA Compliance Group candidates report being tested on.
- Write one worked example in Infrastructure as Code (IaC) and time yourself on it.
Deliverable: One timed worked example in Infrastructure as Code (IaC).
03Work SQL
- Spend the session on SQL, which ACA Compliance Group candidates report being tested on.
- Write one worked example in SQL and time yourself on it.
Deliverable: One timed worked example in SQL.
04Work AWS Cloud Infrastructure Management
- Spend the session on AWS Cloud Infrastructure Management, which ACA Compliance Group candidates report being tested on.
- Write one worked example in AWS Cloud Infrastructure Management and time yourself on it.
Deliverable: One timed worked example in AWS Cloud Infrastructure Management.
05Answer out loud: Technical and Core Programming
- Answer aloud, timed: Test your fundamental programming capabilities, language fluency, and core computer science concepts. Can you explain basic Object-Oriented Programming principles, preferably using Java or C#? Write a basic algorithm to find the frequency of elements in an array. How would you structure this logic into modular functions rather than a single monolithic block? What is the difference between various loop structures, such as using strict inequalities versus inclusive bounds, and when does it matter?
Deliverable: Spoken answers to 1 reported Technical and Core Programming question(s), under time.
06Answer out loud: Database and SQL Fundamentals
- Answer aloud, timed: Evaluate your ability to write efficient queries and manage data relationships. Write a basic SQL script using joins to extract compliance-related data across multiple tables. How would you construct an outer join to handle missing records in a reporting dataset? What considerations do you make when optimizing database queries for performance?
Deliverable: Spoken answers to 1 reported Database and SQL Fundamentals question(s), under time.
07Answer out loud: System Design and Architecture
- Answer aloud, timed: Assess your ability to design scalable, secure, and maintainable software systems. How would you design a cloud-native, globally distributed software solution for scale and flexibility? How do you identify compliance concerns using quantitative methods within system data? What architectural patterns would you use to ensure fault tolerance in an AWS-native environment?
Deliverable: Spoken answers to 1 reported System Design and Architecture question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Explore your collaboration style, professional history, and alignment with company expectations. Tell me about
Explore your collaboration style, professional history, and alignment with company expectations. Tell me about a time you had a conflict with a coworker and how you resolved it. Why do you want to work for ACA Compliance Group, and why should we hire you? How do you handle ambiguous requirements or pushback from stakeholders on a project?
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?
Reverse your own decision and price the reversal
Describe a technical decision you made and later reversed. Pick one that cost something: a service you split and merged back, a cache you added and removed, an index you created that pushed the planner onto a worse plan, a projection you rebuilt from scratch. State what you believed when you decided, the measurement that changed your mind, how long the wrong version ran in production, and what the reversal cost in migrations, dual writes, and a deprecation window for callers you did not own.
Approach
- State the original rationale without irony, in the version you would still defend given what was known then. If it is not defensible, the story is about carelessness rather than judgement, and a different example serves you better.
- Give the measurement that moved with a before and after: the p99 that did not improve, the cache hit rate that sat at 40%, the plan that flipped to a sequential scan once the table passed a size you can name.
- Cost the reversal in steps, not adjectives: expand-and-contract deploys, the dual-write window, the callers who had to be notified, the rows already written in the wrong shape that had to be backfilled or abandoned.
- Distinguish reversal from rewrite by naming what you kept. Most good reversals preserve the schema or the interface and undo one decision inside it, which is also why they were affordable.
Follow-up
- What in that decision was irreversible, and did you know it was irreversible when you made it?
- How did you tell the people who had already built on top of the original decision?
Estimate work you have never done and defend the range
You are asked to estimate a change you have never attempted: add a column to a 100-million-row table, populate it, move reads across, and drop the old shape. Give a range with the assumptions that generate it, including batch size, the signal your backfill throttles on, and wall-clock hours, and name the three unknowns that would move the number most. Then describe a real estimate you gave under comparable ignorance: how you expressed its uncertainty, what you committed to, and how wrong you turned out to be.
Approach
- Decompose into independently deployable steps before estimating anything: add the column nullable, write both shapes, backfill in batches, verify, move reads, stop writing the old shape, drop it. That is four deploys spread over days, and the calendar estimate is dominated by them rather than by the loop's runtime.
- Do the arithmetic aloud for the part that has arithmetic in it: batch size times number of batches times per-batch duration, at a write rate the primary can absorb alongside roughly 1.2k writes per second of production traffic. The loop is throttled by replication lag and lock waits, not by how fast it can issue statements.
- Price the schema step by its lock rather than its statement duration. In PostgreSQL an ALTER TABLE taking ACCESS EXCLUSIVE waits for every open transaction on that table while later queries queue behind it, so a millisecond change issued during a thirty-second analytics query stalls that table for thirty seconds. Adding a nullable column with a non-volatile default avoids a rewrite from version 11; a new index wants CREATE INDEX CONCURRENTLY, which cannot run inside a transaction block and leaves an invalid index behind if it fails.
- Express the answer as a range whose endpoints each trace to a stated assumption, then name the cheapest experiment that collapses it, which is almost always running one real batch against the real table and multiplying.
Follow-up
- How do you verify the backfill genuinely finished, given rows written by production traffic while it ran?
- Where does the backfill resume from after a worker is killed mid-batch, and what makes that resume point trustworthy?
- 01
Explore your collaboration style, professional history, and alignment with company expectations. Tell me about a time you had a conflict with a coworker and how you resolved it. Why do you want to work for ACA Compliance Group, and why should we hire you? How do you handle ambiguous requirements or pushback from stakeholders on a project?
- 02
Describe a technical decision you made and later reversed. Pick one that cost something: a service you split and merged back, a cache you added and removed, an index you created that pushed the planner onto a worse plan, a projection you rebuilt from scratch. State what you believed when you decided, the measurement that changed your mind, how long the wrong version ran in production, and what the reversal cost in migrations, dual writes, and a deprecation window for callers you did not own.
- 03
You are asked to estimate a change you have never attempted: add a column to a 100-million-row table, populate it, move reads across, and drop the old shape. Give a range with the assumptions that generate it, including batch size, the signal your backfill throttles on, and wall-clock hours, and name the three unknowns that would move the number most. Then describe a real estimate you gave under comparable ignorance: how you expressed its uncertainty, what you committed to, and how wrong you turned out to be.
How difficult are the technical interviews at ACA Compliance Group?
The difficulty is generally rated as average. The technical loops focus heavily on solid programming fundamentals, basic data structures, and practical SQL queries rather than obscure algorithmic puzzles. Success relies on writing clean code and clearly communicating your logic.
ACA Compliance Group Software Engineer candidate reports ↗What is the typical timeline from initial screen to offer?
The process typically moves within two to four weeks, encompassing an initial HR screen, a technical phone evaluation, and subsequent onsite or remote panel rounds. Candidates should remain responsive as schedules are coordinated across distributed teams.
ACA Compliance Group Software Engineer candidate reports ↗How much preparation time should I dedicate?
Most candidates benefit from dedicating one to two weeks of focused review, refreshing their understanding of object-oriented programming principles, practicing array manipulation problems, and reviewing basic SQL join syntax.
ACA Compliance Group Software Engineer candidate reports ↗What differentiates successful candidates from others?
Successful candidates demonstrate deep intellectual curiosity about the financial compliance domain. Beyond writing correct code, they ask smart clarifying questions, show interest in the business impact of their work, and communicate collaboratively.
ACA Compliance Group Software Engineer candidate reports ↗Is remote work supported for this position?
Work arrangements vary by specific team and location, with many roles operating under a hybrid model requiring regular onsite presence in designated office hubs, while others may feature initial remote onboarding followed by hybrid schedules.
ACA Compliance Group Software Engineer candidate reports ↗What topics does ACA Compliance Group test in interviews?
ACA Compliance Group interviews most often cover Anti-Money Laundering (AML), KYC (Know Your Customer), Investment Advisers Act of 1940, Securities Exchange Act of 1934, and Investment Company Act of 1940. The exact emphasis depends on the specific role you apply for.
ACA Compliance Group Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01ACA Compliance Group Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Confluent Software Engineer Interview Guide
Concurrency exercises for Confluent candidates: check-then-act races, deadlock from inconsistent lock ordering, and why two individually atomic operations do not compose into an atomic update.
Xebia Software Engineer Interview Guide
What Xebia asks Software Engineer candidates, from reported rounds and questions.
XYZ Software Engineer Interview Guide
What XYZ asks Software Engineer candidates, from reported rounds and questions.
Voya Financial Software Engineer Interview Guide
What Voya Financial asks Software Engineer candidates, from reported rounds and questions.