As a Software Engineer at Intellia Therapeutics, you play a pivotal role in advancing the field of gene editing and therapeutics. This position is critical to the development and deployment of innovative software solutions that support the company's cutting-edge research and therapeutic pipelines. Your contributions will directly impact the efficiency and effectiveness of scientific discoveries, enhancing the capabilities of teams working on revolutionary treatments for genetic diseases. In this role, you will engage with complex systems and collaborate with cross-functional teams, including scientists, bioinformaticians, and product managers. You will help build and maintain software tools that streamline data analysis, improve operational efficiency, and facilitate the delivery of transformative therapies to patients. The work you do will not only challenge you technically but also give you the opportunity to be part of a mission-driven organization dedicated to improving human health.
Recruiter Call
reportedInitial screening call with a recruiter to assess candidate fit for the role.
What to demonstrate
- Initial screening call with a recruiter to assess candidate fit for the role
- Depth in Big-O Time Complexity
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 Interviews
reportedOne or more technical interviews that may include coding and system design assessments.
What to demonstrate
- One or more technical interviews that may include coding and system design assessments
- Depth in Big-O Time Complexity
How to prepare
- Answer aloud and timed: Can you describe how you would optimize a slow-running database query?
- Answer aloud and timed: Describe a challenging project you worked on. What was your role, and how did you overcome obstacles?
On-site Interviews
reportedMeet multiple team members for technical discussions and behavioral assessments.
What to demonstrate
- Meet multiple team members for technical discussions and behavioral assessments
- Depth in Big-O Time Complexity
How to prepare
- Answer aloud and timed: How do you prioritize tasks when managing multiple projects?
- Answer aloud and timed: Can you give an example of how you handled a conflict within a team?
PracHub editorial advice for the preparation topics above.
Research the Company
Understanding Intellia Therapeutics’s mission and recent developments in gene editing will help you tailor your responses and demonstrate genuine interest.
Practice Coding
Engage in regular coding practice, especially focusing on algorithms and data structures, using platforms such as LeetCode or HackerRank.
Prepare Your Questions
Have thoughtful questions ready for your interviewers that reflect your interest in the role and the company.
Showcase Teamwork
Highlight instances where you've successfully collaborated with others, as teamwork is highly valued at Intellia Therapeutics.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Explain how you would implement an in-order traversal of a binary tree.
Explain how you would implement an in-order traversal of a binary tree.
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?
Find overlapping job attempts and peak concurrency from lease records
A day of job_run history yields about 50,000,000 attempt records: (job_run_id, job_type, attempt, started_at, finished_at which is NULL when the worker died, lease_expires_at). Leases expire on a clock, so a job that outran its lease ran twice. Produce (a) every job_run_id whose attempts overlapped in wall-clock time and (b) the peak number of simultaneously running attempts per job_type with the minute it occurred. Target O(n log n). State how you treat a NULL finished_at and what clock skew does to your answer.
Approach
- Define the interval before sorting anything: an attempt occupies [started_at, COALESCE(finished_at, lease_expires_at)). finished_at is observed and lease_expires_at is only a promise, so every attempt without a finish contributes an estimate and the whole result is a lower bound on overlap rather than an exact count.
- For peak concurrency, sweep: emit 2n endpoints, sort by (timestamp, kind) with ends ordered before starts at equal timestamps, then walk the sequence maintaining a counter per job_type and record each type's maximum with its timestamp. O(n log n) dominated by the sort, O(n) space, or O(1) extra if the sort is external and the walk streams.
- For overlap detection, do not compare attempts pairwise. A single global sort by (job_run_id, started_at) gives both the grouping and the order; within a group, keep the maximum end seen so far and report an overlap exactly when the next start is less than that running maximum, which is one linear pass after the sort.
- Half-open intervals matter and are easy to get wrong: with closed intervals an attempt ending at the same millisecond another begins reads as concurrency two, and across 50,000,000 records that artefact swamps the real signal.
Follow-up
- A handler is not idempotent and you have found 400 overlapping jobs. Which of them actually caused damage, and what would you query to find out?
- Peak concurrency for one job_type is 4 against a configured cap of 4. Is the cap working, or is the data hiding attempts that never started?
Collapse a redelivered event batch into per-aggregate high-water marks
You drain a batch of up to 5,000,000 events, each (aggregate_id BIGINT, aggregate_version INT, event_type, payload). The log guarantees order within one aggregate only; the batch merges 64 partitions, and a relay failover has redelivered a range, so an older version for an aggregate can appear after a newer one. Given a map of last_applied_version per aggregate, produce the events worth applying, at most one per (aggregate_id, version), plus the count discarded. Target O(n) time. State the memory for 2,000,000 distinct aggregates and what you do when it does not fit.
Approach
- One pass, one hash map from aggregate_id to the highest version kept, and a discard counter. An event whose version is at or below last_applied_version for its aggregate is dropped without further work, which is the whole reason the event carries its version rather than a delta. O(n) expected time, O(d) space in distinct aggregates.
- Keep the maximum, never the last occurrence. The redelivered range means the final appearance of an aggregate in the batch can be an older version than one seen earlier in the same batch, so last-wins applies stale state over newer state and the projection regresses with no error anywhere.
- Cost the memory instead of calling it large: an 8-byte key plus a 4-byte version is 12 bytes of payload, and an open-addressed table held at a 0.7 load factor costs roughly 17 bytes per entry before per-slot metadata, so 2,000,000 aggregates is tens of megabytes in a native layout and several times that in a runtime that boxes both key and value.
- If the distinct set exceeds memory, partition on hash(aggregate_id) mod P and reduce each partition independently. Every event for one aggregate hashes to the same partition, so the per-partition result is exact and the merge is concatenation rather than a second reduction.
Follow-up
- The payload is a patch rather than a snapshot, so applying only the highest version loses the intermediate changes. What changes in your reduction?
- How do you detect that version 7 arrived while version 6 was never delivered, and what should the consumer do about the gap?
Can you describe how you would optimize a slow-running database query?
Can you describe how you would optimize a slow-running database query?
Approach
- Name the grain you start from and join outward from it.
- Check whether any join is one-to-many before aggregating, or the sums inflate.
- Say which index the query would use, and what makes it unusable.
- 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?
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?
What are the time complexities of common data structure operations, such as insertions and deletions in a heap
What are the time complexities of common data structure operations, such as insertions and deletions in a heap?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
How would you design a system to manage large volumes of genomic data efficiently?
How would you design a system to manage large volumes of genomic data efficiently?
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?
A database is running slowly. What steps would you take to troubleshoot and resolve the issue?
A database is running slowly. What steps would you take to troubleshoot and resolve the issue?
Approach
- Establish what changed and when, before forming any theory.
- Pick a bisection that eliminates candidates whichever way it turns out.
- Check the instrumentation before believing the symptom.
- 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?
Built from the rounds and topics Intellia Therapeutics candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Intellia Therapeutics loop
- Write out the reported sequence: Recruiter Call, Technical Interviews, On-site Interviews.
- 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 Big-O Time Complexity
- Spend the session on Big-O Time Complexity, which Intellia Therapeutics candidates report being tested on.
- Write one worked example in Big-O Time Complexity and time yourself on it.
Deliverable: One timed worked example in Big-O Time Complexity.
03Work Heap Data Structure
- Spend the session on Heap Data Structure, which Intellia Therapeutics candidates report being tested on.
- Write one worked example in Heap Data Structure and time yourself on it.
Deliverable: One timed worked example in Heap Data Structure.
04Work Tree Traversal (In-order Traversal)
- Spend the session on Tree Traversal (In-order Traversal), which Intellia Therapeutics candidates report being tested on.
- Write one worked example in Tree Traversal (In-order Traversal) and time yourself on it.
Deliverable: One timed worked example in Tree Traversal (In-order Traversal).
05Answer out loud: Technical / Domain Questions
- Answer aloud, timed: Explain how you would implement an in-order traversal of a binary tree.
- Answer aloud, timed: What are the time complexities of common data structure operations, such as insertions and deletions in a heap?
Deliverable: Spoken answers to 2 reported Technical / Domain Questions question(s), under time.
06Answer out loud: Behavioral / Leadership
- Answer aloud, timed: Describe a challenging project you worked on. What was your role, and how did you overcome obstacles?
- Answer aloud, timed: How do you prioritize tasks when managing multiple projects?
Deliverable: Spoken answers to 2 reported Behavioral / Leadership question(s), under time.
07Answer out loud: Problem-Solving / Case Studies
- Answer aloud, timed: A database is running slowly. What steps would you take to troubleshoot and resolve the issue?
- Answer aloud, timed: How would you design a system to manage large volumes of genomic data efficiently?
Deliverable: Spoken answers to 2 reported Problem-Solving / Case Studies 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 challenging project you worked on. What was your role, and how did you overcome obstacles?
Describe a challenging project you worked on. What was your role, and how did you overcome obstacles?
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 prioritize tasks when managing multiple projects?
How do you prioritize tasks when managing multiple projects?
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?
Can you give an example of how you handled a conflict within a team?
Can you give an example of how you handled a conflict within a team?
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?
Discuss a time when you had to learn a new technology quickly. How did you approach it?
Discuss a time when you had to learn a new technology quickly. How did you approach it?
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 challenging project you worked on. What was your role, and how did you overcome obstacles?
- 02
How do you prioritize tasks when managing multiple projects?
- 03
Can you give an example of how you handled a conflict within a team?
- 04
Discuss a time when you had to learn a new technology quickly. How did you approach it?
How difficult are the interviews, and how much preparation time is typical?
The interviews are generally considered average in difficulty, with candidates recommending at least a few weeks of dedicated preparation focusing on technical skills and behavioral questions.
Intellia Therapeutics Software Engineer candidate reports ↗What differentiates successful candidates?
Successful candidates often demonstrate strong technical knowledge, effective communication skills, and a clear alignment with the company’s mission and values.
Intellia Therapeutics Software Engineer candidate reports ↗What is the culture and working style like at Intellia Therapeutics?
Intellia Therapeutics fosters a collaborative and innovative culture, encouraging employees to bring their unique perspectives to the table while working toward common goals.
Intellia Therapeutics Software Engineer candidate reports ↗What is the typical timeline from the initial screen to receiving an offer?
The timeline can vary but typically ranges from a few weeks to a couple of months, depending on the number of interview rounds and candidate availability.
Intellia Therapeutics Software Engineer candidate reports ↗Are there remote work or hybrid expectations?
While this can depend on team dynamics and project requirements, many roles at Intellia Therapeutics offer flexible work arrangements, including remote work options.
Intellia Therapeutics Software Engineer candidate reports ↗What topics does Intellia Therapeutics test in interviews?
Intellia Therapeutics interviews most often cover Cross-functional Collaboration, Stakeholder Communication, QA Engineering, Data Architecture, and Big-O Time Complexity. The exact emphasis depends on the specific role you apply for.
Intellia Therapeutics Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01Intellia Therapeutics Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Cognition Software Engineer Interview Guide
What Cognition asks Software Engineer candidates, from reported rounds and questions.
Vercel Software Engineer Interview Guide
Debugging practice for Vercel software engineer prep built on a reproduction you trust, narrowing to the smallest failing input, and changing one variable per run so the result stays attributable.
Together Ai Software Engineer Interview Guide
Failure-handling practice for Together Ai software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
Spotify Software Engineer Interview Guide
Timed practice for Spotify software engineer candidates who lose time to the clock: short problems taken end to end, then reviewed against a written rubric rather than a passing test run.