cswork / libraryOpen practice workspace

Interview guides · Unity

Unity Software Engineer Interview Guide

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

The 60-second brief

Unity hires Software Engineers; this guide collects what candidates report about the process.

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

Focus areas

  • Unity (engine)
  • Technical Assessments (coding tests)
  • Game Development

The Unity interview process

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

Phone Screening

Initial call with a talent acquisition recruiter to discuss your background and alignment with the position.

What to demonstrate

  • Initial call with a talent acquisition recruiter to discuss your background and alignment with the position
  • Depth in Unity (engine)

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.

Hiring Manager Interview

Detailed discussion with the hiring manager about past technical projects and team fit.

What to demonstrate

  • Detailed discussion with the hiring manager about past technical projects and team fit
  • Depth in Unity (engine)

How to prepare

  • Prepare two projects you led end to end, each with the decision you owned and what it cost.
  • Have three questions about the team's roadmap and how success is measured in the first six months.

Technical Evaluation

Practical skills assessment which may include an online coding challenge or a take-home assignment.

What to demonstrate

  • Practical skills assessment which may include an online coding challenge or a take-home assignment
  • Depth in Unity (engine)

How to prepare

  • Answer aloud and timed: Identify and refactor an inefficient $O(N^2)$ algorithm down to linear time complexity.
  • Answer aloud and timed: Design a high-throughput feature platform that ingests raw event streams and delivers feature vectors for real-time model inference.

Virtual Onsite Panel

Multiple interviews with team members and leads focusing on technical problem-solving and culture fit.

What to demonstrate

  • Multiple interviews with team members and leads focusing on technical problem-solving and culture fit
  • Depth in Unity (engine)

How to prepare

  • Answer aloud and timed: Architect an end-to-end bidding and ad placement system capable of handling strict latency SLAs under high concurrent load.
  • Answer aloud and timed: How would you design a modular plugin and package management architecture for an extensible IDE or 3D engine editor?

Where candidates lose points

Master the STAR Method for Behavioral Rounds

Prepare clear, concise past examples highlighting technical ownership, resolving cross-functional friction, and learning from project setbacks.

Think Out Loud During Technical Exercises

Clearly communicate your thought process, state assumptions, and discuss trade-offs while writing code or designing systems.

Review Core Memory & Lifecycle Mechanics

Pay close attention to language-specific memory management rules, such as C# garbage collection patterns or C++ dynamic allocation and thread safety.

Questions & practice

Implement a custom binary search tree insertion and traversal logic, ensuring robust handling of edge cases.

Medium · Coding & Algorithms

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?

Solve an array manipulation problem by optimizing both time complexity and memory allocations.

Medium · Coding & Algorithms

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?

Given a raw data payload, parse and convert it into a hierarchical data structure suitable for rendering or UI

Medium · Coding & Algorithms

Given a raw data payload, parse and convert it into a hierarchical data structure suitable for rendering or UI layout.

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?

Write an algorithm to process spatial nodes and calculate distances across a multi-dimensional grid.

Medium · Coding & Algorithms

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?

Identify and refactor an inefficient $O(N^2)$ algorithm down to linear time complexity.

Medium · Coding & Algorithms

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?

Explain C# garbage collection mechanisms and strategies to eliminate runtime allocations inside high-frequency

Medium · Engine, Graphics & Domain Concepts

Explain C# garbage collection mechanisms and strategies to eliminate runtime allocations inside high-frequency frame loops.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Review a code snippet or pull request and provide structured feedback on thread safety, memory management, and

Medium · Engine, Graphics & Domain Concepts

Review a code snippet or pull request and provide structured feedback on thread safety, memory management, and code readability.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Keep soft-deleted accounts from blocking re-registration

Easy · soft delete · unique constraints · engine differences

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

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

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?

Design a high-throughput feature platform that ingests raw event streams and delivers feature vectors for real

Medium · System Design & Architecture

Design a high-throughput feature platform that ingests raw event streams and delivers feature vectors for real-time model inference.

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?

Architect an end-to-end bidding and ad placement system capable of handling strict latency SLAs under high con

Medium · System Design & Architecture

Architect an end-to-end bidding and ad placement system capable of handling strict latency SLAs under high concurrent load.

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 modular plugin and package management architecture for an extensible IDE or 3D engine e

Medium · System Design & Architecture

How would you design a modular plugin and package management architecture for an extensible IDE or 3D engine editor?

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?

Design a real-time analytics backend to process and aggregate client telemetry from millions of concurrent mob

Medium · System Design & Architecture

Design a real-time analytics backend to process and aggregate client telemetry from millions of concurrent mobile applications.

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 an offline batch data pipeline to guarantee data reproducibility and strict SLA complianc

Medium · System Design & Architecture

How do you structure an offline batch data pipeline to guarantee data reproducibility and strict SLA compliance?

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 core linear algebra concepts—such as dot products, cross products, and transformation matrices—apply to

Medium · Engine, Graphics & Domain Concepts

How do core linear algebra concepts—such as dot products, cross products, and transformation matrices—apply to spatial calculations?

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?

Describe your step-by-step approach to diagnosing and fixing a rendering artifact or shader failure across mob

Medium · Engine, Graphics & Domain Concepts

Describe your step-by-step approach to diagnosing and fixing a rendering artifact or shader failure across mobile hardware targets.

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?

Analyze a provided C# script or Unity project module to identify memory leaks, excessive draw calls, and perfo

Medium · Engine, Graphics & Domain Concepts

Analyze a provided C# script or Unity project module to identify memory leaks, excessive draw calls, and performance bottlenecks.

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

Day 1 — Map the Unity loop

  • Write out the reported sequence: Phone Screening, Hiring Manager Interview, Technical Evaluation, Virtual Onsite Panel.
  • 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 Unity (engine)

  • Spend the session on Unity (engine), which Unity candidates report being tested on.
  • Write one worked example in Unity (engine) and time yourself on it.

Deliverable: One timed worked example in Unity (engine).

Day 3 — Work Technical Assessments (coding tests)

  • Spend the session on Technical Assessments (coding tests), which Unity candidates report being tested on.
  • Write one worked example in Technical Assessments (coding tests) and time yourself on it.

Deliverable: One timed worked example in Technical Assessments (coding tests).

Day 4 — Work Game Development

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

Deliverable: One timed worked example in Game Development.

Day 5 — Answer out loud: Coding & Algorithms

  • Answer aloud, timed: Implement a custom binary search tree insertion and traversal logic, ensuring robust handling of edge cases.
  • Answer aloud, timed: Solve an array manipulation problem by optimizing both time complexity and memory allocations.

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

Day 6 — Answer out loud: System Design & Architecture

  • Answer aloud, timed: Design a high-throughput feature platform that ingests raw event streams and delivers feature vectors for real-time model inference.
  • Answer aloud, timed: Architect an end-to-end bidding and ad placement system capable of handling strict latency SLAs under high concurrent load.

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

Day 7 — Answer out loud: Engine, Graphics & Domain Concepts

  • Answer aloud, timed: Explain C# garbage collection mechanisms and strategies to eliminate runtime allocations inside high-frequency frame loops.
  • Answer aloud, timed: Analyze a provided C# script or Unity project module to identify memory leaks, excessive draw calls, and performance bottlenecks.

Deliverable: Spoken answers to 2 reported Engine, Graphics & Domain Concepts question(s), under time.

Behavioural preparation

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

Describe a project where you made a technical mistake. How did you discover it, and what steps did you take to

Medium · Behavioral & Culture Fit

Describe a project where you made a technical mistake. How did you discover it, and what steps did you take to remediate the issue?

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 situations where aggressive product deadlines conflict with reducing technical debt?

Medium · Behavioral & Culture Fit

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 worked with cross-functional partners (such as Product Managers, UX Designers, or QA)

Medium · Behavioral & Culture Fit

Tell me about a time you worked with cross-functional partners (such as Product Managers, UX Designers, or QA) who held competing priorities.

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 approach code reviews to maintain high engineering standards while fostering a supportive team envi

Medium · Behavioral & Culture Fit

How do you approach code reviews to maintain high engineering standards while fostering a supportive team environment?

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 scenario where you had to rapidly learn an unfamiliar technology or programming language to deliver

Medium · Behavioral & Culture Fit

Describe a scenario where you had to rapidly learn an unfamiliar technology or programming language to deliver a critical 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?