At X Development (formerly Google X), the "Moonshot Factory," a Software Engineer does not work on standard, incremental product updates. Instead, you are tasked with turning science-fiction-sounding ideas into viable, world-changing realities. Engineers here operate at the absolute bleeding edge of technology, building the foundational software systems for early-stage projects like Tapestry (the future of the electric grid), Bellwether (geospatial ML for crisis response), and Materra (sustainable materials and hardware integration). This role is critical because software is the glue that binds physical hardware, complex simulations, and massive datasets together. Whether you are developing real-time geospatial pipelines, building high-throughput backend architectures, or designing intuitive user interfaces for complex scientific tools, your work directly influences whether a moonshot project succeeds or fails. You will work in highly multidisciplinary teams alongside scientists, hardware engineers, and business strategists who are all trying to solve problems that have never been solved before. Because these projects operate like highly funded, early-stage startups, your work will involve a high degree of ambiguity. You must be comfortable writing code that is flexible enough to pivot when the underlying science or business model changes.
Recruiter Screen
reportedInitial conversation to discuss your background, interest in the Moonshot Factory, and alignment with a specific project.
What to demonstrate
- Initial conversation to discuss your background, interest in the Moonshot Factory, and alignment with a specific project
- Depth in Backend Engineering
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 Phone Screens
reportedOne or two technical phone interviews focusing on live coding and system design.
What to demonstrate
- One or two technical phone interviews focusing on live coding and system design
- Depth in Backend Engineering
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.
Multi-Round Interview Loop
reportedConsists of deep technical discussions, live coding sessions, system architecture deep dives, and behavioral interviews.
What to demonstrate
- Consists of deep technical discussions, live coding sessions, system architecture deep dives, and behavioral interviews
- Depth in Backend Engineering
How to prepare
- Answer aloud and timed: Design a telemetry ingestion pipeline for millions of IoT devices deployed across a smart grid system.
- Answer aloud and timed: How would you architect a backend system for a project like Tapestry to handle real-time simulation of electrical grids?
PracHub editorial advice for the preparation topics above.
Clarify role expectations early
Because X Development hires for a wide variety of specialized, early-stage projects, job descriptions can sometimes be ambiguous. Ask your recruiter early on about the exact balance of coding, system design, and domain-specific knowledge expected for your role.
Do not let an interviewer's pressure or questioning style throw you off
If you are asked to code a solution live, stay calm, write out a working brute-force solution first, and then optimize. Focus on showing a valid, logical approach rather than getting flustered by unexpected constraints.
Show cross-functional empathy
During behavioral rounds, emphasize your ability to work with non-software professionals. Use examples where you successfully translated complex technical concepts for hardware engineers, scientists, or business partners to achieve a shared goal.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Implement a function to solve a specific mathematical equation or physics-based simulation constraint in real
Implement a function to solve a specific mathematical equation or physics-based simulation constraint in real time.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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?
Write a clean, optimized algorithm to parse and filter highly nested geospatial data points.
Write a clean, optimized algorithm to parse and filter highly nested geospatial data points.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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?
Given a stream of sensor data, write a function to calculate a rolling average while handling missing or corru
Given a stream of sensor data, write a function to calculate a rolling average while handling missing or corrupted data points.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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?
Keep soft-deleted accounts from blocking re-registration
app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.
Approach
- Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
- Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
- For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
- State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.
Follow-up
- A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
- How do you honour an erasure request while resource_revision.actor_user_id still references this table?
Find version gaps and relay lag with window functions
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
- 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.
- 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.
- 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.
- 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?
Design an in-memory data structure that can efficiently track and update supply chain inventory levels across
Design an in-memory data structure that can efficiently track and update supply chain inventory levels across multiple nodes.
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?
Design a telemetry ingestion pipeline for millions of IoT devices deployed across a smart grid system.
Design a telemetry ingestion pipeline for millions of IoT devices deployed across a smart grid system.
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?
How would you architect a backend system for a project like Tapestry to handle real-time simulation of electri
How would you architect a backend system for a project like Tapestry to handle real-time simulation of electrical grids?
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?
Design a geospatial data processing pipeline that can ingest, process, and serve satellite imagery to machine
Design a geospatial data processing pipeline that can ingest, process, and serve satellite imagery to machine learning models.
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?
Architect a developer productivity platform that allows multiple early-stage project teams to spin up isolated
Architect a developer productivity platform that allows multiple early-stage project teams to spin up isolated testing environments quickly.
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?
p99 jumped on one listing filter while p50 stayed flat
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
- 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.
- 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.
- 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.
- 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?
Built from the rounds and topics X Development candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the X Development loop
- Write out the reported sequence: Recruiter Screen, Technical Phone Screens, Multi-Round Interview Loop.
- 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 Backend Engineering
- Spend the session on Backend Engineering, which X Development candidates report being tested on.
- Write one worked example in Backend Engineering and time yourself on it.
Deliverable: One timed worked example in Backend Engineering.
03Work Live Coding / Pair Programming
- Spend the session on Live Coding / Pair Programming, which X Development candidates report being tested on.
- Write one worked example in Live Coding / Pair Programming and time yourself on it.
Deliverable: One timed worked example in Live Coding / Pair Programming.
04Work Full-Stack Engineering
- Spend the session on Full-Stack Engineering, which X Development candidates report being tested on.
- Write one worked example in Full-Stack Engineering and time yourself on it.
Deliverable: One timed worked example in Full-Stack Engineering.
05Answer out loud: Coding and Algorithmic Logic
- Answer aloud, timed: Implement a function to solve a specific mathematical equation or physics-based simulation constraint in real time.
- Answer aloud, timed: Write a clean, optimized algorithm to parse and filter highly nested geospatial data points.
Deliverable: Spoken answers to 2 reported Coding and Algorithmic Logic question(s), under time.
06Answer out loud: System Design and Architecture
- Answer aloud, timed: Design a telemetry ingestion pipeline for millions of IoT devices deployed across a smart grid system.
- Answer aloud, timed: How would you architect a backend system for a project like Tapestry to handle real-time simulation of electrical grids?
Deliverable: Spoken answers to 2 reported System Design and Architecture question(s), under time.
07Answer out loud: Behavioral and Ambiguity Management
- Answer aloud, timed: Describe a time when you had to build a software tool for a domain expert (e.g., a hardware engineer or scientist) who did not understand software constraints. How did you align on expectations?
- Answer aloud, timed: Tell me about a time when a project’s requirements changed completely mid-development. How did you adapt your architecture?
Deliverable: Spoken answers to 2 reported Behavioral and Ambiguity Management 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.
Describe a time when you had to build a software tool for a domain expert (e.g., a hardware engineer or scient
Describe a time when you had to build a software tool for a domain expert (e.g., a hardware engineer or scientist) who did not understand software constraints. How did you align on expectations?
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?
Tell me about a time when a project’s requirements changed completely mid-development. How did you adapt your
Tell me about a time when a project’s requirements changed completely mid-development. How did you adapt your architecture?
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?
Give an example of a time you had to make a technical decision with highly incomplete or ambiguous data.
Give an example of a time you had to make a technical decision with highly incomplete or ambiguous data.
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?
How do you handle a situation where an interviewer or teammate challenges your coding approach during a live s
How do you handle a situation where an interviewer or teammate challenges your coding approach during a live session?
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?
- 01
Describe a time when you had to build a software tool for a domain expert (e.g., a hardware engineer or scientist) who did not understand software constraints. How did you align on expectations?
- 02
Tell me about a time when a project’s requirements changed completely mid-development. How did you adapt your architecture?
- 03
Give an example of a time you had to make a technical decision with highly incomplete or ambiguous data.
- 04
How do you handle a situation where an interviewer or teammate challenges your coding approach during a live session?
How technical are the coding rounds, especially for hybrid or multi-disciplinary roles?
The coding rounds are highly technical and rigorous. Even if a role is advertised as sitting at the interface of software and another field (like hardware or supply chain), you will still be evaluated by core software engineers. Expect to write live, clean, and optimized code in front of an interviewer. Do not assume the coding expectations will be lowered because of your specialized domain knowledge.
X Development Software Engineer candidate reports ↗How much preparation time is typical for the X Development interview loop?
Most successful candidates spend 4 to 8 weeks preparing. This time should be split between practicing core algorithmic coding, studying system design principles for large-scale data and IoT systems, and structuring behavioral stories that highlight your ability to thrive in ambiguous, fast-changing environments.
X Development Software Engineer candidate reports ↗What is the culture like across different X projects?
The culture is highly entrepreneurial, collaborative, and intellectually stimulating. Because each project (like Tapestry or Bellwether) operates like an early-stage startup within the larger organization, teams are highly mission-driven and close-knit. You will work alongside incredibly smart people who are passionate about solving hard, real-world problems.
X Development Software Engineer candidate reports ↗How does X Development handle project pivots or project cancellations?
Project pivots and cancellations are a normal, expected part of the lifecycle at X Development. If a project is sunset, the organization makes a concerted effort to redeploy talented engineers to other active moonshots or early-stage initiatives. Resilience and a lack of attachment to specific codebases are key to thriving here.
X Development Software Engineer candidate reports ↗What topics does X Development test in interviews?
X Development interviews most often cover Backend Engineering, Engineering Management, Technical Leadership, Developer Productivity Engineering, and Distributed Systems. The exact emphasis depends on the specific role you apply for.
X Development Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
Official role evidence, timestamped platform data and clearly labeled preparation advice.
- 01X Development Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
candidate · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
platform · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
platform · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Zyphra Software Engineer Interview Guide
What Zyphra asks Software Engineer candidates, from reported rounds and questions.
XPeng Motors Software Engineer Interview Guide
What XPeng Motors asks Software Engineer candidates, from reported rounds and questions.
Virtualitics Software Engineer Interview Guide
What Virtualitics asks Software Engineer candidates, from reported rounds and questions.
Vecna Robotics Software Engineer Interview Guide
What Vecna Robotics asks Software Engineer candidates, from reported rounds and questions.