At TaskRabbit, a Software Engineer does more than just write code; you build the digital infrastructure that powers the gig economy for everyday life. TaskRabbit, a wholly-owned subsidiary of IKEA, operates a two-sided marketplace that connects "Clients" (people who need help) with "Taskers" (people who provide services). In this role, you are responsible for the reliability, scalability, and evolution of a platform that supports thousands of livelihoods and millions of tasks—from furniture assembly and moving help to home repairs. You will work within a collaborative, cross-functional environment, often organized into squads focused on specific domains such as Marketplace Dynamics, Payments, Growth, or Tasker Success. The engineering culture here balances the stability required by a mature platform (founded in 2008) with the agility needed to launch new features. You will likely touch a stack heavily rooted in Ruby on Rails on the backend and React/Redux on the frontend, contributing to products that directly impact user trust and conversion rates. This position is critical because TaskRabbit is currently navigating a phase of technical modernization and strategic growth. Engineers are expected to not only deliver features but also help pay down technical debt, improve architectural health, and ensure the platform can handle the complexities of international markets and deep integration with the IKEA ecosystem.
Recruiter Screen
reportedInitial discussion with a recruiter about your background and interest in the gig economy space.
What to demonstrate
- Initial discussion with a recruiter about your background and interest in the gig economy space
- Depth in React
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.
Take-Home Coding Exercise
reportedA competency filter exercise that is generally considered fairly easy and assesses your coding skills.
What to demonstrate
- A competency filter exercise that is generally considered fairly easy and assesses your coding skills
- Depth in React
How to prepare
- Answer aloud and timed: "Login Flow": Pair program a complete login form using React, handling success, failure, validation errors, and retry logic.
- Answer aloud and timed: "Vanilla JS Riddles": Solve logic puzzles using plain JavaScript within a test framework.
Virtual Onsite Loop
reportedAn intensive phase consisting of multiple 1-hour technical rounds segmented by technology, including Rails, React, and a behavioral chat.
What to demonstrate
- An intensive phase consisting of multiple 1-hour technical rounds segmented by technology
- Including Rails, React, and a behavioral chat
How to prepare
- Answer aloud and timed: "Design Tic-Tac-Toe": Model the data structures and API for a Tic-Tac-Toe game. How do you store the board? How do you validate a win?
- Answer aloud and timed: "Architecture Design": Design a high-level architecture for a specific feature of the TaskRabbit platform (e.g., search or real-time chat).
PracHub editorial advice for the preparation topics above.
Refresh Your Redux
Many candidates stumble on the specific boilerplate and patterns of Redux. Ensure you can set up a store, actions, and reducers without constantly checking documentation.
Be a "Fixer
During the debugging round, talk through your debugging strategy out loud. Show that you know how to use browser dev tools, console logs, and breakpoints effectively.
Know the Product
Download the app and browse the site. Understanding the flow of booking a task (selecting a category, choosing a Tasker, payment) will give you a huge advantage during the System Design and Product interviews.
Ask About the IKEA Integration
Showing curiosity about how TaskRabbit integrates with IKEA (e.g., furniture assembly tasks) demonstrates business acumen and genuine interest in the company's strategic direction.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
"Needle in a Haystack": Write a function to find elements from one array ("needles") inside another larger arr
"Needle in a Haystack": Write a function to find elements from one array ("needles") inside another larger array ("haystack").
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?
Identify the heaviest tenants in a five-minute window under memory pressure
The edge service handles about 3,000 requests per second across roughly 50,000 tenants, peaking near 9,000. Expose the 50 heaviest tenants by request count over the trailing five minutes so limits can be tightened before one tenant's backfill starves the fleet. You may not retain five minutes of raw records. Give the exact solution and its memory, then the bounded-memory approximation with its error stated as a formula, and say which you would ship and at what tenant cardinality that choice changes.
Approach
- Do the exact version first, because it is affordable at this cardinality: a ring of 300 one-second counters per tenant, advanced lazily, is 1,200 bytes of counters per tenant and roughly 60 to 90 MB for 50,000 tenants with overhead. Carry a running total and subtract the bucket you overwrite so a window read is O(1) rather than 300 adds.
- Extract the top 50 with a size-k min-heap over the tenant sums: O(d log k) for d tenants, against O(d log d) to sort them all. Maintaining the heap continuously instead of on query requires a tenant-to-heap-index map, because incrementing a count already inside the heap means sifting from a known position, and without that map you rebuild the heap on every request.
- State the approximation precisely rather than gesturing at sketches. Misra-Gries with m counters retains every item whose true count exceeds N/(m+1), and each retained count underestimates the truth by at most N/(m+1). With m = 1,000 and N = 900,000 requests in the window the error is roughly 900 requests, which is fine for spotting a tenant sending 50,000 and useless for ranking two tenants 200 apart.
- Say what breaks when the window slides: Misra-Gries and Space-Saving are insert-only and cannot be decremented as records age out. The workable construction is one summary per sub-window, say ten seconds, with 30 summaries merged at query time, and the merged error is the sum of the per-summary errors, so the bound degrades linearly in the number of sub-windows.
Follow-up
- The heaviest tenant is heavy because of one export job rather than user traffic. Should the limiter treat those as the same tenant?
- Two tenants sit tied at the boundary of the top 50. Does your answer flap, and does the flapping matter?
Diff a projection against the primary without per-row point reads
The listing projection has drifted and some rows show a stale version. The primary holds 40,000,000 resource rows across 12,000 tenants while serving 1,200 writes and 14,000 reads per second. The obvious repair, reading each resource row and comparing its version against the projection, is correct and would eventually finish. Explain precisely why it is unacceptable here, then give a diff that finds the differing rows, state its complexity, and make it safe to run against a live primary. Replication lag is usually under 100 ms and is not bounded.
Approach
- Quantify the naive cost rather than calling it slow: 40,000,000 point reads at even 0.5 ms each is over five hours serialised, and the only lever is concurrency, which is exactly what you cannot spend. The primary's pool is sized for the write path, and 40,000,000 random reads evict the buffer cache that sustains the 85 percent cache hit rate, so the audit degrades the system it is auditing.
- Replace random access with one ordered pass per side. Both sides can be read in (tenant_id, resource_id) order, which is a sequential scan on each and a merge join in O(n) time and O(1) memory. For a dense diff that is the whole answer, and it reads the primary once instead of 40,000,000 times.
- For the expected sparse case, compare range hashes instead of rows: partition the key space, compute per range an order-independent aggregate over hash(resource_id, version), compare aggregates, and descend only into ranges that differ. With d differing rows and branching factor B, at most d ranges mismatch per level, so the drill-down examines O(d log_B(n/d)) ranges and reads full rows only in mismatching leaves.
- Aggregate with a sum modulo 2^64 or a multiset hash, never XOR. XOR is order-independent but self-cancelling, so two rows wrong in the same way, or a row duplicated on one side, leave the range aggregate matching and the range is declared clean.
Follow-up
- The diff reports 900 stale rows. How do you decide between patching those rows and rebuilding the projection from resource_revision?
- Same job, but the projection lives in a search index that cannot be scanned in key order. What changes?
Replace offset paging on the resource feed with keyset
resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.
Approach
- Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
- Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
- Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
- Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.
Follow-up
- The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
- Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?
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?
"Design Tic-Tac-Toe": Model the data structures and API for a Tic-Tac-Toe game. How do you store the board? Ho
"Design Tic-Tac-Toe": Model the data structures and API for a Tic-Tac-Toe game. How do you store the board? How do you validate a win?
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
"Architecture Design": Design a high-level architecture for a specific feature of the TaskRabbit platform (e.g
"Architecture Design": Design a high-level architecture for a specific feature of the TaskRabbit platform (e.g., search or real-time chat).
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?
"Fix this JIRA bug": You are given a React/Redux codebase where a feature (like a button click or data load) i
"Fix this JIRA bug": You are given a React/Redux codebase where a feature (like a button click or data load) is broken. You must find the error and fix it.
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?
"Login Flow": Pair program a complete login form using React, handling success, failure, validation errors, an
"Login Flow": Pair program a complete login form using React, handling success, failure, validation errors, and retry logic.
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?
"Vanilla JS Riddles": Solve logic puzzles using plain JavaScript within a test framework.
"Vanilla JS Riddles": Solve logic puzzles using plain JavaScript within a test framework.
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 TaskRabbit candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the TaskRabbit loop
- Write out the reported sequence: Recruiter Screen, Take-Home Coding Exercise, Virtual Onsite 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 React
- Spend the session on React, which TaskRabbit candidates report being tested on.
- Write one worked example in React and time yourself on it.
Deliverable: One timed worked example in React.
03Work System Design
- Spend the session on System Design, which TaskRabbit candidates report being tested on.
- Write one worked example in System Design and time yourself on it.
Deliverable: One timed worked example in System Design.
04Work Rails
- Spend the session on Rails, which TaskRabbit candidates report being tested on.
- Write one worked example in Rails and time yourself on it.
Deliverable: One timed worked example in Rails.
05Answer out loud: Coding & Debugging
- Answer aloud, timed: "Fix this JIRA bug": You are given a React/Redux codebase where a feature (like a button click or data load) is broken. You must find the error and fix it.
- Answer aloud, timed: "Needle in a Haystack": Write a function to find elements from one array ("needles") inside another larger array ("haystack").
Deliverable: Spoken answers to 2 reported Coding & Debugging question(s), under time.
06Answer out loud: System Design
- Answer aloud, timed: "Design Tic-Tac-Toe": Model the data structures and API for a Tic-Tac-Toe game. How do you store the board? How do you validate a win?
- Answer aloud, timed: "Architecture Design": Design a high-level architecture for a specific feature of the TaskRabbit platform (e.g., search or real-time chat).
Deliverable: Spoken answers to 2 reported System Design question(s), under time.
07Answer out loud: Behavioral & Product
- Answer aloud, timed: "If you were not working as an engineer, what would you do?"
- Answer aloud, timed: "Tell me about a time you had to fix a critical bug under pressure."
Deliverable: Spoken answers to 2 reported Behavioral & Product 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.
"If you were not working as an engineer, what would you do?"
"If you were not working as an engineer, what would you do?"
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 you had to fix a critical bug under pressure."
"Tell me about a time you had to fix a critical bug under pressure."
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 technical disagreements with a product manager?"
"How do you handle technical disagreements with a product manager?"
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
"If you were not working as an engineer, what would you do?"
- 02
"Tell me about a time you had to fix a critical bug under pressure."
- 03
"How do you handle technical disagreements with a product manager?"
How difficult is the coding assessment?
The consensus is that the coding challenges are of medium difficulty. They are not designed to trick you but to test your practical ability to write and debug code. The "Needle in a Haystack" problem is algorithmic, but the onsite exercises are often more focused on application logic.
TaskRabbit Software Engineer candidate reports ↗What is the work culture like regarding remote work?
TaskRabbit operates on a hybrid model. Most new hires in hub locations (San Francisco, NYC, London) are expected to be in the office approximately 2 days a week. It is important to clarify your location expectations early with the recruiter.
TaskRabbit Software Engineer candidate reports ↗Is the codebase modern?
TaskRabbit has been around since 2008. You will likely encounter a mix of legacy code (older Rails/JS) and modern code (React Hooks). A significant part of the engineering reality is maintaining and modernizing this existing infrastructure.
TaskRabbit Software Engineer candidate reports ↗How long does the hiring process take?
The average timeline is roughly 2 to 3 weeks. The process is generally described as efficient, though scheduling the full virtual onsite loop can sometimes add time depending on interviewer availability.
TaskRabbit Software Engineer candidate reports ↗What topics does TaskRabbit test in interviews?
TaskRabbit interviews most often cover Python, Problem Solving, SQL, Data Structures, and Machine Learning. The exact emphasis depends on the specific role you apply for.
TaskRabbit Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
Official role evidence, timestamped platform data and clearly labeled preparation advice.
- 01TaskRabbit 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.
Zumper Software Engineer Interview Guide
What Zumper asks Software Engineer candidates, from reported rounds and questions.
Zwift Software Engineer Interview Guide
What Zwift asks Software Engineer candidates, from reported rounds and questions.
Zyphra Software Engineer Interview Guide
What Zyphra asks Software Engineer candidates, from reported rounds and questions.
Zendar Software Engineer Interview Guide
What Zendar asks Software Engineer candidates, from reported rounds and questions.