cswork / libraryOpen practice workspace

Interview guides · Tutor Intelligence

Tutor Intelligence Software Engineer Interview Guide

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

The 60-second brief

At Tutor Intelligence, a Software Engineer sits at the intersection of cutting-edge artificial intelligence, robust physical automation, and high-leverage software development. The company is actively building the software, hardware, and operational pipelines required to deploy smart, collaborative robots into American factories and warehouses. Rather than building standard enterprise SaaS dashboards, engineers here write code that directly controls physical systems, processes complex real-world data, and orchestrates distributed fleets of industrial robots. The role demands a unique combination of deep technical fundamentals and extreme pragmatism. Because Tutor Intelligence is an agile, high-intensity startup founded by MIT alumni, engineers are expected to own features end-to-end—from backend infrastructure and cloud services to developer tooling and user interfaces.

This guide is scoped to a Software Engineer candidate at Tutor Intelligence.

Focus areas

  • Python
  • Algorithmic Problem Solving
  • Take-home Coding Assignments

The Tutor Intelligence interview process

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

Introductory Call

Brief call to discuss mutual alignment between the candidate and Tutor Intelligence.

What to demonstrate

  • Brief call to discuss mutual alignment between the candidate and Tutor Intelligence
  • Depth in Python

How to prepare

  • Answer aloud and timed: Implement a custom CPU scheduling algorithm that prioritizes tasks based on resource constraints, arrival times, and execution dependencies.
  • Answer aloud and timed: Write a program to parse an input ASCII grid representing a physical circuit board, identifying components and tracing the wire connections between them.

Timed Coding Assessments

Multiple timed coding challenges to evaluate technical skills and coding speed.

What to demonstrate

  • Multiple timed coding challenges to evaluate technical skills and coding speed
  • Depth in Python

How to prepare

  • Answer aloud and timed: Build a circuit dependency graph from a raw dataset and recursively evaluate the output signal of the circuit using memoization to optimize performance.
  • Answer aloud and timed: Given a matrix representing a warehouse floor plan, implement a breadth-first search (BFS) algorithm to find the shortest path for a mobile robot navigating around dynamic obstacles.

Deeper Technical Rounds

Intensive technical interviews focusing on advanced coding and problem-solving abilities.

What to demonstrate

  • Intensive technical interviews focusing on advanced coding and problem-solving abilities
  • Depth in Python

How to prepare

  • Answer aloud and timed: Write a Python script to ingest, clean, and analyze a raw sensor dataset, identifying anomalies and structuring the output to be consumed by a downstream machine learning pipeline.
  • Answer aloud and timed: Design and implement a real-time circuitry emulator in Python that simulates signal propagation through logic gates and handles feedback loops without crashing.

Final Round

Multi-hour final assessment to evaluate overall fit and technical expertise.

What to demonstrate

  • Multi-hour final assessment to evaluate overall fit and technical expertise
  • Depth in Python

How to prepare

  • Answer aloud and timed: Build a lightweight state machine to manage the operational states of a robotic arm, ensuring safe transitions and robust error handling during sensor failures.
  • Answer aloud and timed: Implement a custom rate-limiter for an internal API that manages high-throughput data streams from physical Edge devices.

Where candidates lose points

Practice Coding Without an IDE

Since the testing environment can be highly restrictive, practice solving medium-to-hard graph and scheduling algorithms in a basic text editor. Ensure you can write clean Python syntax and debug logic errors without relying on autocomplete or real-time linter warnings.

Clarify Compensation Early

Compensation transparency can vary during the initial stages. Do not hesitate to ask the hiring team directly about the specific salary range and equity structure for your target role during your first conversation to ensure alignment.

Emphasize AI Tooling Experience

Tutor Intelligence is highly focused on AI-augmented development. Be prepared to discuss your specific workflows using Cursor, Claude Code, or other LLM-based development tools. Share concrete examples of how you maintain high code quality and architectural rigor while using these tools to accelerate your output.

When discussing AI-augmented development, avoid sounding like you blindly accept LLM outputs

Focus on how you act as the "human in the loop" to verify correctness, design robust architectures, and prevent code bloat.

Questions & practice

Implement a custom CPU scheduling algorithm that prioritizes tasks based on resource constraints, arrival time

Medium · Python & Algorithmic Challenges

Implement a custom CPU scheduling algorithm that prioritizes tasks based on resource constraints, arrival times, and execution dependencies.

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 a program to parse an input ASCII grid representing a physical circuit board, identifying components and

Medium · Python & Algorithmic Challenges

Write a program to parse an input ASCII grid representing a physical circuit board, identifying components and tracing the wire connections between them.

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?

Build a circuit dependency graph from a raw dataset and recursively evaluate the output signal of the circuit

Medium · Python & Algorithmic Challenges

Build a circuit dependency graph from a raw dataset and recursively evaluate the output signal of the circuit using memoization to optimize performance.

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 matrix representing a warehouse floor plan, implement a breadth-first search (BFS) algorithm to find t

Medium · Python & Algorithmic Challenges

Given a matrix representing a warehouse floor plan, implement a breadth-first search (BFS) algorithm to find the shortest path for a mobile robot navigating around dynamic obstacles.

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 a Python script to ingest, clean, and analyze a raw sensor dataset, identifying anomalies and structurin

Medium · Python & Algorithmic Challenges

Write a Python script to ingest, clean, and analyze a raw sensor dataset, identifying anomalies and structuring the output to be consumed by a downstream machine learning pipeline.

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?

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?

Denormalise tenant onto revisions and backfill it live

Hard · denormalisation · online migration · backfill

resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.

Approach

  1. Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
  2. Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
  3. Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
  4. Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.

Follow-up

  • The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
  • How do you verify the backfill actually finished, given rows are still being inserted while it runs?

Design and implement a real-time circuitry emulator in Python that simulates signal propagation through logic

Medium · System & Emulation Problems

Design and implement a real-time circuitry emulator in Python that simulates signal propagation through logic gates and handles feedback loops without crashing.

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?

Build a lightweight state machine to manage the operational states of a robotic arm, ensuring safe transitions

Medium · System & Emulation Problems

Build a lightweight state machine to manage the operational states of a robotic arm, ensuring safe transitions and robust error handling during sensor failures.

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?

Implement a custom rate-limiter for an internal API that manages high-throughput data streams from physical Ed

Medium · System & Emulation Problems

Implement a custom rate-limiter for an internal API that manages high-throughput data streams from physical Edge devices.

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?

Debate a complex technical trade-off (such as monolithic vs. microservices architecture for robotics orchestra

Medium · Behavioral & Group Discussion Topics

Debate a complex technical trade-off (such as monolithic vs. microservices architecture for robotics orchestration) in a group setting with other candidates.

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?

One customer endpoint stalls deliveries to every other destination

Medium · bulkhead · timeouts · saturation

The egress service delivers about 1.5k webhooks/second across 40,000 destinations, with a per-destination concurrency cap of 4 and a 10-second connect-plus-read timeout. Throughput falls to 300/second, queue depth climbs, and p99 delivery latency for unaffected destinations goes from 200 ms to minutes, while the error rate barely moves. One tenant holds 900 destination rows whose URLs share a hostname that now answers in 9.5 seconds. Explain the mechanism with the arithmetic, then give the containment in the order you would apply it.

Approach

  1. Look at saturation before errors. A flat error rate with collapsing throughput says nothing is failing, things are waiting, so the first signal to pull is in-flight request count or pool wait time rather than the error counter. This is the distinction that decides the whole investigation.
  2. Group in-flight work by resolved host, not by destination id. The cap is keyed per destination row, so 900 rows sharing one hostname buy 3,600 concurrent slots against a single host, each held for 9.5 seconds. The bulkhead was never a bulkhead for that host, and grouping by the wrong dimension is why the dashboard looked healthy.
  3. Do the arithmetic in both directions. Required concurrency is arrival rate times latency, so 1.5k/second at 200 ms needs about 300 in flight, which is entirely consumed by 3,600 slow slots; conversely whatever concurrency is left sustains rate equals concurrency divided by 9.5 seconds, which is the 300/second you are seeing. Matching both numbers is what promotes this from a plausible story to the mechanism.
  4. Explain why the circuit breaker never helped. It opens on consecutive failures, and a 9.5-second response inside a 10-second timeout is a success. Slow is not failing, so an error-rate breaker cannot see this; you need a slow-call ratio, a deadline propagated from the caller's remaining budget, or a concurrency limiter.

Follow-up

  • The host recovers to 80 ms. How long does the queue take to drain, and what does the drain do to the recovered host?
  • Where should the 10-second timeout number actually come from?

Suggested practice checklist

Built from the rounds and topics Tutor Intelligence candidates report.

Day 1 — Map the Tutor Intelligence loop

  • Write out the reported sequence: Introductory Call, Timed Coding Assessments, Deeper Technical Rounds, Final Round.
  • 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 Python

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

Deliverable: One timed worked example in Python.

Day 3 — Work Algorithmic Problem Solving

  • Spend the session on Algorithmic Problem Solving, which Tutor Intelligence candidates report being tested on.
  • Write one worked example in Algorithmic Problem Solving and time yourself on it.

Deliverable: One timed worked example in Algorithmic Problem Solving.

Day 4 — Work Take-home Coding Assignments

  • Spend the session on Take-home Coding Assignments, which Tutor Intelligence candidates report being tested on.
  • Write one worked example in Take-home Coding Assignments and time yourself on it.

Deliverable: One timed worked example in Take-home Coding Assignments.

Day 5 — Answer out loud: Python & Algorithmic Challenges

  • Answer aloud, timed: Implement a custom CPU scheduling algorithm that prioritizes tasks based on resource constraints, arrival times, and execution dependencies.
  • Answer aloud, timed: Write a program to parse an input ASCII grid representing a physical circuit board, identifying components and tracing the wire connections between them.

Deliverable: Spoken answers to 2 reported Python & Algorithmic Challenges question(s), under time.

Day 6 — Answer out loud: System & Emulation Problems

  • Answer aloud, timed: Design and implement a real-time circuitry emulator in Python that simulates signal propagation through logic gates and handles feedback loops without crashing.
  • Answer aloud, timed: Build a lightweight state machine to manage the operational states of a robotic arm, ensuring safe transitions and robust error handling during sensor failures.

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

Day 7 — Answer out loud: Behavioral & Group Discussion Topics

  • Answer aloud, timed: Discuss how you balance speed versus code quality when deploying critical software to physical machines that operate around human workers.
  • Answer aloud, timed: Debate a complex technical trade-off (such as monolithic vs. microservices architecture for robotics orchestration) in a group setting with other candidates.

Deliverable: Spoken answers to 2 reported Behavioral & Group Discussion Topics question(s), under time.

Behavioural preparation

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

Discuss how you balance speed versus code quality when deploying critical software to physical machines that o

Medium · Behavioral & Group Discussion Topics

Discuss how you balance speed versus code quality when deploying critical software to physical machines that operate around human workers.

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Describe a time when you utilized AI-augmented development tools to solve a highly complex system bug that tra

Medium · Behavioral & Group Discussion Topics

Describe a time when you utilized AI-augmented development tools to solve a highly complex system bug that traditional debugging methods failed to resolve.

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?

Estimate work you have never done and defend the range

Hard · estimation · backfills · expand-contract

You are asked to estimate a change you have never attempted: add a column to a 100-million-row table, populate it, move reads across, and drop the old shape. Give a range with the assumptions that generate it, including batch size, the signal your backfill throttles on, and wall-clock hours, and name the three unknowns that would move the number most. Then describe a real estimate you gave under comparable ignorance: how you expressed its uncertainty, what you committed to, and how wrong you turned out to be.

Approach

  1. Decompose into independently deployable steps before estimating anything: add the column nullable, write both shapes, backfill in batches, verify, move reads, stop writing the old shape, drop it. That is four deploys spread over days, and the calendar estimate is dominated by them rather than by the loop's runtime.
  2. Do the arithmetic aloud for the part that has arithmetic in it: batch size times number of batches times per-batch duration, at a write rate the primary can absorb alongside roughly 1.2k writes per second of production traffic. The loop is throttled by replication lag and lock waits, not by how fast it can issue statements.
  3. Price the schema step by its lock rather than its statement duration. In PostgreSQL an ALTER TABLE taking ACCESS EXCLUSIVE waits for every open transaction on that table while later queries queue behind it, so a millisecond change issued during a thirty-second analytics query stalls that table for thirty seconds. Adding a nullable column with a non-volatile default avoids a rewrite from version 11; a new index wants CREATE INDEX CONCURRENTLY, which cannot run inside a transaction block and leaves an invalid index behind if it fails.
  4. Express the answer as a range whose endpoints each trace to a stated assumption, then name the cheapest experiment that collapses it, which is almost always running one real batch against the real table and multiplying.

Follow-up

  • How do you verify the backfill genuinely finished, given rows written by production traffic while it ran?
  • Where does the backfill resume from after a worker is killed mid-batch, and what makes that resume point trustworthy?