cswork / libraryOpen practice workspace

Interview guides · SoundThinking

SoundThinking Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at SoundThinking plays a vital role in developing technology that directly impacts public safety and community well-being. SoundThinking is a leading provider of public safety technology solutions, best known for its acoustic gunshot detection system, ShotSpotter, as well as its broader SafetySmart Platform solutions. In this role, you are not just writing code; you are building and maintaining highly resilient, real-time systems that help law enforcement and first responders save lives and build safer neighborhoods. The engineering challenges you will tackle here are unique and highly complex. They involve processing massive streams of IoT sensor data, optimizing low-latency routing algorithms, managing complex geospatial telemetry, and scaling cloud infrastructure to guarantee high availability.

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

Focus areas

  • Software Engineering (general)
  • Platform Engineering
  • Critical Infrastructure Domain Knowledge

The SoundThinking interview process

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

Recruiter Call

Initial conversation with a recruiter to discuss your background, career goals, and interest in SoundThinking.

What to demonstrate

  • Initial conversation with a recruiter to discuss your background, career goals, and interest in SoundThinking
  • Depth in Software Engineering (general)

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 Evaluations

Progress through a series of technical and behavioral evaluations, including coding assessments and system design discussions.

What to demonstrate

  • Progress through a series of technical and behavioral evaluations
  • Including coding assessments and system design discussions

How to prepare

  • Answer aloud and timed: How do you optimize database queries for geospatial data, and what are the trade-offs between different indexing strategies?
  • Answer aloud and timed: Describe a scenario where you had to debug a memory leak or a performance bottleneck in a production environment. What tools and methodologies did you use?

Panel Interviews

Participate in panel interviews with engineering leadership and cross-functional team members.

What to demonstrate

  • Participate in panel interviews with engineering leadership and cross-functional team members
  • Depth in Software Engineering (general)

How to prepare

  • Answer aloud and timed: How would you design a highly available API that remains operational even during a regional cloud outage?
  • Answer aloud and timed: Why do you want to work at SoundThinking, and how does our mission to improve public safety resonate with your career goals?

Final Stages

Final stages may be conducted online or in person at one of their key offices.

What to demonstrate

  • Final stages may be conducted online or in person at one of their key offices
  • Depth in Software Engineering (general)

How to prepare

  • Answer aloud and timed: Describe a time when you had to explain a highly complex technical concept to a non-technical stakeholder or customer success team member.
  • Answer aloud and timed: Tell me about a time you disagreed with a teammate on an architectural decision. How did you resolve the conflict and reach a consensus?

Where candidates lose points

Focus on real-world trade-offs

When designing systems or writing code, don't just present the "perfect" solution. Explain the trade-offs of your approach regarding latency, cost, maintainability, and complexity.

Understand the domain

Take time to understand how acoustic gunshot detection and safety platforms work. Showing that you comprehend the unique challenges of processing audio telemetry and geospatial data will impress your interviewers.

Be prepared to discuss your experience with AWS services

SoundThinking relies heavily on cloud infrastructure to keep its real-time alerting systems resilient and highly available.

Structure your behavioral answers

Use the STAR method (Situation, Task, Action, Result) to keep your answers concise and impactful. Focus heavily on the "Action" you took and the "Result" or impact of your work.

Questions & practice

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?

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?

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?

Stop tag and share joins from fanning out a page

Medium · join fan-out · semi-joins · many-to-many

resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.

Approach

  1. Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
  2. Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
  3. Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
  4. Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.

Follow-up

  • The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
  • A resource can be shared with the same user twice under different permissions. Does your count change, and should it?

Find version gaps and relay lag with window functions

Medium · window functions · event tables · frame semantics

outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.

Approach

  1. Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
  2. Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
  3. Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
  4. Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.

Follow-up

  • Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
  • Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?

How would you design a system to ingest, process, and analyze real-time acoustic sensor data from thousands of

Medium · Technical & System Architecture

How would you design a system to ingest, process, and analyze real-time acoustic sensor data from thousands of IoT devices simultaneously?

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?

Explain how you would handle out-of-order data packets in a distributed messaging system like Kafka or RabbitM

Medium · Technical & System Architecture

Explain how you would handle out-of-order data packets in a distributed messaging system like Kafka or RabbitMQ.

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 optimize database queries for geospatial data, and what are the trade-offs between different indexi

Medium · Technical & System Architecture

How do you optimize database queries for geospatial data, and what are the trade-offs between different indexing strategies?

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 would you design a highly available API that remains operational even during a regional cloud outage?

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

Describe a scenario where you had to debug a memory leak or a performance bottleneck in a production environme

Medium · Technical & System Architecture

Describe a scenario where you had to debug a memory leak or a performance bottleneck in a production environment. What tools and methodologies did you use?

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?

Describe a situation where you took ownership of a critical production issue. How did you coordinate with othe

Medium · Behavioral & Mission Alignment

Describe a situation where you took ownership of a critical production issue. How did you coordinate with other teams to resolve it?

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

Day 1 — Map the SoundThinking loop

  • Write out the reported sequence: Recruiter Call, Technical Evaluations, Panel Interviews, Final Stages.
  • 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 Software Engineering (general)

  • Spend the session on Software Engineering (general), which SoundThinking candidates report being tested on.
  • Write one worked example in Software Engineering (general) and time yourself on it.

Deliverable: One timed worked example in Software Engineering (general).

Day 3 — Work Platform Engineering

  • Spend the session on Platform Engineering, which SoundThinking candidates report being tested on.
  • Write one worked example in Platform Engineering and time yourself on it.

Deliverable: One timed worked example in Platform Engineering.

Day 4 — Work Critical Infrastructure Domain Knowledge

  • Spend the session on Critical Infrastructure Domain Knowledge, which SoundThinking candidates report being tested on.
  • Write one worked example in Critical Infrastructure Domain Knowledge and time yourself on it.

Deliverable: One timed worked example in Critical Infrastructure Domain Knowledge.

Day 5 — Answer out loud: Technical & System Architecture

  • Answer aloud, timed: How would you design a system to ingest, process, and analyze real-time acoustic sensor data from thousands of IoT devices simultaneously?
  • Answer aloud, timed: Explain how you would handle out-of-order data packets in a distributed messaging system like Kafka or RabbitMQ.

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

Day 6 — Answer out loud: Behavioral & Mission Alignment

  • Answer aloud, timed: Why do you want to work at SoundThinking, and how does our mission to improve public safety resonate with your career goals?
  • Answer aloud, timed: Describe a time when you had to explain a highly complex technical concept to a non-technical stakeholder or customer success team member.

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

Day 7 — Dry run for SoundThinking

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

Behavioural preparation

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

Why do you want to work at SoundThinking, and how does our mission to improve public safety resonate with your

Medium · Behavioral & Mission Alignment

Why do you want to work at SoundThinking, and how does our mission to improve public safety resonate with your career goals?

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 explain a highly complex technical concept to a non-technical stakeholder or c

Medium · Behavioral & Mission Alignment

Describe a time when you had to explain a highly complex technical concept to a non-technical stakeholder or customer success team member.

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 me about a time you disagreed with a teammate on an architectural decision. How did you resolve the confl

Medium · Behavioral & Mission Alignment

Tell me about a time you disagreed with a teammate on an architectural decision. How did you resolve the conflict and reach a consensus?

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?

Share an experience where you had to quickly adapt to a major change in project requirements or priorities. Ho

Medium · Behavioral & Mission Alignment

Share an experience where you had to quickly adapt to a major change in project requirements or priorities. How did you handle it?

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?