cswork / libraryOpen practice workspace

Interview guides · Alameda County

Alameda County Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Alameda County, you play a vital role in building, maintaining, and modernizing the digital infrastructure that serves over 1.6 million residents. Unlike private-sector roles that focus solely on commercial metrics, your work here directly impacts public health, safety, public works, and social services. You will design and support application ecosystems that streamline county operations, manage public assets, and provide critical services to the community. The engineering team at Alameda County tackles complex integration challenges, transitioning legacy systems into modern web applications while maintaining high standards of data security and regulatory compliance.

This guide is scoped to a Software Engineer candidate at Alameda County.

Focus areas

  • Technical communication
  • Writing solutions under time constraints
  • Problem solving under time limits

The Alameda County interview process

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

HR Screening

Initial review of your application and minimum qualifications by HR.

What to demonstrate

  • Initial review of your application and minimum qualifications by HR
  • Depth in Technical communication

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.

Panel Interview

First interview with external engineers from other county divisions for technical assessment.

What to demonstrate

  • First interview with external engineers from other county divisions for technical assessment
  • Depth in Technical communication

How to prepare

  • Answer aloud and timed: What strategies do you use to ensure data security and prevent SQL injection in web applications?
  • Answer aloud and timed: How do you approach version control and code deployment when working with multiple developers on a shared county system?

Departmental Interview

Interview with the hiring manager and immediate team, often including a timed written assessment.

What to demonstrate

  • Interview with the hiring manager and immediate team, often including a timed written assessment
  • Depth in Technical communication

How to prepare

  • Answer aloud and timed: Describe a time when you had to explain a complex technical issue or system limitation to a non-technical department head. How did you structure your communication?
  • Answer aloud and timed: How do you prioritize your tasks when multiple county departments submit urgent, competing feature requests?

Where candidates lose points

Understand the Panel Dynamic

Your interviews will be conducted by panels of three to four people. Address your answers to the entire panel, maintain eye contact, and structure your responses clearly so that all members—including any non-technical observers—can follow your logic.

During panel interviews, the panel members take detailed notes

Speak at a moderate pace to allow them to capture your key points accurately.

Align with Public Service Values

Remember that the county's primary goal is service delivery, not profit. Frame your technical achievements in terms of reliability, public access, cost savings for taxpayers, and security.

Questions & practice

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

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

Collapse a redelivered event batch into per-aggregate high-water marks

Easy · hashing · at-least-once · aggregation

You drain a batch of up to 5,000,000 events, each (aggregate_id BIGINT, aggregate_version INT, event_type, payload). The log guarantees order within one aggregate only; the batch merges 64 partitions, and a relay failover has redelivered a range, so an older version for an aggregate can appear after a newer one. Given a map of last_applied_version per aggregate, produce the events worth applying, at most one per (aggregate_id, version), plus the count discarded. Target O(n) time. State the memory for 2,000,000 distinct aggregates and what you do when it does not fit.

Approach

  1. One pass, one hash map from aggregate_id to the highest version kept, and a discard counter. An event whose version is at or below last_applied_version for its aggregate is dropped without further work, which is the whole reason the event carries its version rather than a delta. O(n) expected time, O(d) space in distinct aggregates.
  2. Keep the maximum, never the last occurrence. The redelivered range means the final appearance of an aggregate in the batch can be an older version than one seen earlier in the same batch, so last-wins applies stale state over newer state and the projection regresses with no error anywhere.
  3. Cost the memory instead of calling it large: an 8-byte key plus a 4-byte version is 12 bytes of payload, and an open-addressed table held at a 0.7 load factor costs roughly 17 bytes per entry before per-slot metadata, so 2,000,000 aggregates is tens of megabytes in a native layout and several times that in a runtime that boxes both key and value.
  4. If the distinct set exceeds memory, partition on hash(aggregate_id) mod P and reduce each partition independently. Every event for one aggregate hashes to the same partition, so the per-partition result is exact and the merge is concatenation rather than a second reduction.

Follow-up

  • The payload is a patch rather than a snapshot, so applying only the highest version loses the intermediate changes. What changes in your reduction?
  • How do you detect that version 7 arrived while version 6 was never delivered, and what should the consumer do about the gap?

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

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

Explain how you would optimize a slow-running SQL query in a database containing millions of public records.

Medium · Technical & Systems Engineering

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

What strategies do you use to ensure data security and prevent SQL injection in web applications?

Medium · Technical & Systems Engineering

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Describe your experience with API integration, specifically when connecting a modern web application to a lega

Medium · Technical & Systems Engineering

Describe your experience with API integration, specifically when connecting a modern web application to a legacy mainframe system.

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?

How do you approach version control and code deployment when working with multiple developers on a shared coun

Medium · Technical & Systems Engineering

How do you approach version control and code deployment when working with multiple developers on a shared county system?

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?

Draft a brief, non-technical email explaining a system outage to county employees, detailing the impact and es

Medium · Written & Communication Assessments

Draft a brief, non-technical email explaining a system outage to county employees, detailing the impact and estimated time to resolution.

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?

Write a short technical proposal outlining the benefits of migrating an on-premise system to a hybrid cloud en

Medium · Written & Communication Assessments

Write a short technical proposal outlining the benefits of migrating an on-premise system to a hybrid cloud environment.

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?

p99 jumped on one listing filter while p50 stayed flat

Medium · query planning · composite index · percentiles

After a release that added an owner_user_id filter to the resource listing, p99 rose from 90 ms to 1.9 s while p50 stayed at 40 ms. Traffic and row counts are unchanged. resource carries the index (tenant_id, status, updated_at DESC, resource_id DESC). The new query filters tenant_id and owner_user_id, orders by updated_at DESC, resource_id DESC, and takes 20 rows. On PostgreSQL, explain the shape of the regression, prove it from a query plan, and give the index you would add.

Approach

  1. Start from the shape. A flat p50 with a moved p99 means a subset of requests changed cost, not all of them, so the first job is naming the subset. Bucket the endpoint's latency by the tenant's row count; the natural hypothesis is that large tenants are a small share of requests and all of the tail.
  2. Get the plan for the new query on a large tenant with EXPLAIN (ANALYZE, BUFFERS). Expect an index scan over the tenant's range, a filter discarding most of it, then a Sort feeding the Limit, possibly reporting Sort Method: external merge Disk. Read actual rows on the scan node, not estimated.
  3. Explain why the existing index cannot serve it. A composite B-tree is seekable only as a left prefix, and with no equality predicate on status the scan cannot treat updated_at as an ordering, because rows in the tenant's range are ordered by status first. Everything matching must be read and sorted before LIMIT 20 can apply, so a tenant with 400,000 rows pays 400,000 rows to return 20.
  4. Add (tenant_id, owner_user_id, updated_at DESC, resource_id DESC). Equality on the first two columns leaves the index ordered by updated_at within that pair, so the plan becomes an index scan that stops after 20 rows with no Sort node. PostgreSQL can scan a B-tree backwards, so the DESC markers matter only if the two sort columns ever disagree in direction; keeping them explicit documents the order the keyset cursor depends on.

Follow-up

  • The endpoint paginates with OFFSET. What does page 500 cost with your index, and what does the keyset version cost?
  • How would you have caught this before release, given that a 10,000-row seed database produces the same plan shape at an unnoticeable cost?

Suggested practice checklist

Built from the rounds and topics Alameda County candidates report.

Day 1 — Map the Alameda County loop

  • Write out the reported sequence: HR Screening, Panel Interview, Departmental 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 Technical communication

  • Spend the session on Technical communication, which Alameda County candidates report being tested on.
  • Write one worked example in Technical communication and time yourself on it.

Deliverable: One timed worked example in Technical communication.

Day 3 — Work Writing solutions under time constraints

  • Spend the session on Writing solutions under time constraints, which Alameda County candidates report being tested on.
  • Write one worked example in Writing solutions under time constraints and time yourself on it.

Deliverable: One timed worked example in Writing solutions under time constraints.

Day 4 — Work Problem solving under time limits

  • Spend the session on Problem solving under time limits, which Alameda County candidates report being tested on.
  • Write one worked example in Problem solving under time limits and time yourself on it.

Deliverable: One timed worked example in Problem solving under time limits.

Day 5 — Answer out loud: Technical & Systems Engineering

  • Answer aloud, timed: Explain how you would optimize a slow-running SQL query in a database containing millions of public records.
  • Answer aloud, timed: Describe your experience with API integration, specifically when connecting a modern web application to a legacy mainframe system.

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

Day 6 — Answer out loud: Situational & Behavioral

  • Answer aloud, timed: Describe a time when you had to explain a complex technical issue or system limitation to a non-technical department head. How did you structure your communication?
  • Answer aloud, timed: How do you prioritize your tasks when multiple county departments submit urgent, competing feature requests?

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

Day 7 — Answer out loud: Written & Communication Assessments

  • Answer aloud, timed: Draft a brief, non-technical email explaining a system outage to county employees, detailing the impact and estimated time to resolution.
  • Answer aloud, timed: Write a short technical proposal outlining the benefits of migrating an on-premise system to a hybrid cloud environment.

Deliverable: Spoken answers to 2 reported Written & Communication Assessments question(s), under time.

Behavioural preparation

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

Describe a time when you had to explain a complex technical issue or system limitation to a non-technical depa

Medium · Situational & Behavioral

Describe a time when you had to explain a complex technical issue or system limitation to a non-technical department head. How did you structure your communication?

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 prioritize your tasks when multiple county departments submit urgent, competing feature requests?

Medium · Situational & Behavioral

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Tell us about a project where you had to work with legacy code. How did you balance the need for modern update

Medium · Situational & Behavioral

Tell us about a project where you had to work with legacy code. How did you balance the need for modern updates with the risk of breaking existing functionality?

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 motivated you to apply for a software engineering role in public service, and how do you align with the c

Medium · Situational & Behavioral

What motivated you to apply for a software engineering role in public service, and how do you align with the county's mission?

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?