Radar Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Radar plays a critical role in building and scaling the world's leading geofencing and location platform. Unlike traditional engineering roles that operate in silos, engineers at Radar are product-minded builders. You will be responsible for developing high-performance APIs, SDKs, and developer tools that process billions of location updates daily. The work here directly impacts how top-tier global brands across retail, logistics, and hospitality power their location-based experiences. Because Radar is a developer-first product, the engineering team places an incredibly high bar on performance, reliability, and developer experience. You will solve complex geospatial problems, optimize low-latency database queries, and design robust distributed systems that can handle massive spikes in real-time traffic.

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

Focus areas

• CI/CD Pipelines
• Deployment
• System Design

The Radar interview process

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

Initial Screen

A 30-minute introductory call with a recruiter or the CTO to discuss your background and career goals.

What to demonstrate

• A 30-minute introductory call with a recruiter or the CTO to discuss your background and career goals
• Depth in CI/CD Pipelines

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 Assessment

Complete either a take-home programming assignment or a structured 2-hour coding challenge focusing on real-world problems.

What to demonstrate

• Complete either a take-home programming assignment or a structured 2-hour coding challenge focusing on real-world problems
• Depth in CI/CD Pipelines

How to prepare

• Answer aloud and timed: How do you handle database write bottlenecks when processing high-volume, real-time location telemetry?
• Answer aloud and timed: What strategies would you use to ensure data consistency across multiple distributed services during a network partition?

Virtual Onsite

Split into two 3-hour sessions, including system design, technical deep dives, and behavioral conversations.

What to demonstrate

• Split into two 3-hour sessions
• Including system design, technical deep dives, and behavioral conversations

How to prepare

• Answer aloud and timed: Write a program that parses a stream of coordinate data and groups them into logical geographic clusters.
• Answer aloud and timed: How would you optimize a slow-running background worker that processes batch location updates?

Where candidates lose points

Showcase your operational background

Don't treat deployment as an afterthought. Be ready to discuss how you test your code, how you deploy it safely, and how you monitor its health in production.

Focus on simplicity

During system design and coding rounds, present the simplest working solution first. Explain the trade-offs of adding complexity before you actually write the code or draw the architecture.

Bring product-minded questions

When given the opportunity to ask questions, ask about product roadmap priorities, customer pain points, and how engineering collaborates with product management. This shows you care about the why behind the code.

Questions & practice

Write a program that parses a stream of coordinate data and groups them into logical geographic clusters.

Medium · Practical Coding & Implementation

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. State the target complexity and say which constraint rules the naive version out.

Follow-up

• How does this change if the input no longer fits in memory?
• What is the worst case, and how likely is it on real data?

How would you optimize a slow-running background worker that processes batch location updates?

Medium · Practical Coding & Implementation

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. State the target complexity and say which constraint rules the naive version out.

Follow-up

• How does this change if the input no longer fits in memory?
• What is the worst case, and how likely is it on real data?

Merge partitioned event streams into one ordered feed with bounded lateness

Hard · k-way merge · watermarks · out-of-order streams

The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.

Approach

1. Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
2. Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
3. Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
4. Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.

Follow-up

• The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
• The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?

How do you manage zero-downtime deployments for database schema migrations on highly active tables?

Medium · Deployment, Infrastructure & CI/CD

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?

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

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

How would you design a rate-limiting system for a public API that processes millions of requests per second?

Medium · System Design & 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 how you would architect a real-time geofencing engine that triggers notifications when users enter sp

Medium · System Design & Architecture

Describe how you would architect a real-time geofencing engine that triggers notifications when users enter specific geographic boundaries.

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?

What strategies would you use to ensure data consistency across multiple distributed services during a network

Medium · System Design & Architecture

What strategies would you use to ensure data consistency across multiple distributed services during a network partition?

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?

Implement a thread-safe cache with an eviction policy suitable for high-throughput API endpoints.

Medium · Practical Coding & Implementation

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?

Walk me through how you have set up a CI/CD pipeline from scratch in a previous role.

Medium · Deployment, Infrastructure & CI/CD

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 structure tests for an asynchronous event-driven service to prevent flaky test suites?

Medium · Practical Coding & Implementation

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?

What metrics and monitoring tools do you prioritize when debugging a performance degradation in production?

Medium · Deployment, Infrastructure & CI/CD

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

Day 1 — Map the Radar loop

• Write out the reported sequence: Initial Screen, Technical Assessment, Virtual Onsite.
• 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 CI/CD Pipelines

• Spend the session on CI/CD Pipelines, which Radar candidates report being tested on.
• Write one worked example in CI/CD Pipelines and time yourself on it.

Deliverable: One timed worked example in CI/CD Pipelines.

Day 3 — Work Deployment

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

Deliverable: One timed worked example in Deployment.

Day 4 — Work System Design

• Spend the session on System Design, which Radar candidates report being tested on.
• Write one worked example in System Design and time yourself on it.

Deliverable: One timed worked example in System Design.

Day 5 — Answer out loud: System Design & Architecture

• Answer aloud, timed: How would you design a rate-limiting system for a public API that processes millions of requests per second?
• Answer aloud, timed: Describe how you would architect a real-time geofencing engine that triggers notifications when users enter specific geographic boundaries.

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

Day 6 — Answer out loud: Practical Coding & Implementation

• Answer aloud, timed: Write a program that parses a stream of coordinate data and groups them into logical geographic clusters.
• Answer aloud, timed: How would you optimize a slow-running background worker that processes batch location updates?

Deliverable: Spoken answers to 2 reported Practical Coding & Implementation question(s), under time.

Day 7 — Answer out loud: Deployment, Infrastructure & CI/CD

• Answer aloud, timed: Walk me through how you have set up a CI/CD pipeline from scratch in a previous role.
• Answer aloud, timed: How do you manage zero-downtime deployments for database schema migrations on highly active tables?

Deliverable: Spoken answers to 2 reported Deployment, Infrastructure & CI/CD question(s), under time.

Behavioural preparation

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

How do you handle database write bottlenecks when processing high-volume, real-time location telemetry?

Medium · System Design & Architecture

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 a deployment went wrong and how you diagnosed and rollbacked the system safely.

Medium · Deployment, Infrastructure & CI/CD

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 had to make a technical trade-off to meet a tight product deadline.

Medium · Behavioral & Alignment

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 handle disagreements with product managers regarding the scope or technical feasibility of a featur

Medium · Behavioral & Alignment

How do you handle disagreements with product managers regarding the scope or technical feasibility of a feature?

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 situation where you took complete ownership of a project from initial concept to production deploym

Medium · Behavioral & Alignment

Describe a situation where you took complete ownership of a project from initial concept to production deployment.

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 mentor junior engineers and foster a culture of high engineering standards within your team?

Medium · Behavioral & Alignment

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?