As a Software Engineer at dunnhumby, you are at the heart of the world’s leading customer data science company. Your work directly enables the processing, analysis, and activation of massive retail datasets that drive personalization and loyalty programs for global retailers. You will be building scalable, resilient systems that translate complex data science models into tangible business value. This role requires a strong balance of core engineering fundamentals and an appreciation for data-centric architectures. You will contribute to products that influence the shopping experiences of millions of consumers daily. Whether you are developing robust APIs, optimizing data pipelines, or building out web applications, your code must perform reliably at an enterprise scale. Expect to operate in an environment where technical rigor, clean code practices, and system performance are heavily scrutinized. The problems you solve will be complex, requiring you to navigate ambiguity, design high-level architectures, and collaborate closely with data scientists, product managers, and engineering peers.
Recruiter Phone Screen
reportedInitial call to discuss your background, expectations, and logistics.
What to demonstrate
- Initial call to discuss your background, expectations, and logistics
- Depth in Software Engineering
How to prepare
- Be able to walk your CV end to end in two minutes, and say why this company specifically.
- Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.
Online Assessment
reportedCoding assessment hosted on platforms like HackerEarth to test basic coding and computer science knowledge.
What to demonstrate
- Coding assessment hosted on platforms like HackerEarth to test basic coding and computer science knowledge
- Depth in Software Engineering
How to prepare
- Answer aloud and timed: How does indexing work in a relational database, and when would you avoid using it?
- Answer aloud and timed: Describe the various transaction isolation levels in a DBMS.
Technical Rounds
reportedRigorous technical interviews that may include live coding, conceptual questions, or a take-home assignment.
What to demonstrate
- Rigorous technical interviews that may include live coding, conceptual questions, or a take-home assignment
- Depth in Software Engineering
How to prepare
- Answer aloud and timed: How do you resolve merge conflicts in Git, and what is your preferred branching strategy?
- Answer aloud and timed: Write a program to implement a basic sorting algorithm and explain its time complexity.
Managerial Interview
reportedComprehensive interview with a hiring manager focusing on technical and competency aspects.
What to demonstrate
- Comprehensive interview with a hiring manager focusing on technical and competency aspects
- Depth in Software Engineering
How to prepare
- Answer aloud and timed: Given a string, write a function to find the first non-repeating character.
- Answer aloud and timed: How would you structure a take-home assignment to demonstrate Test-Driven Development (TDD)?
PracHub editorial advice for the preparation topics above.
Embrace Test-Driven Development
If you are given a coding task with a generous time limit, do not just write the solution. Write the tests first or alongside your code. Interviewers at dunnhumby actively look for candidates who prioritize TDD and robust error handling.
Prepare for the Rapid-Fire Round
Some candidates report facing technical rounds with dozens of quick-fire questions covering OOP, OS, and DBMS. Brush up on your core CS trivia so you can answer these confidently and concisely without stalling.
Do not underestimate the importance of time management during coding assessments
If you spend too much time over-engineering a solution or struggling with minor bugs (like float rounding issues), you may run out of time to demonstrate your full capability.
Know Your Resume Inside Out
You will be asked to draw high-level diagrams and discuss the architecture of your past projects. Be ready to defend the technical choices you made, the trade-offs you considered, and the business impact of your work.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Can you explain the difference between a process and a thread in an Operating System?
Can you explain the difference between a process and a thread in an Operating System?
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- 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?
Write a program to implement a basic sorting algorithm and explain its time complexity.
Write a program to implement a basic sorting algorithm and explain its time complexity.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Given a string, write a function to find the first non-repeating character.
Given a string, write a function to find the first non-repeating character.
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?
How would you structure a take-home assignment to demonstrate Test-Driven Development (TDD)?
How would you structure a take-home assignment to demonstrate Test-Driven Development (TDD)?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Write an executable code snippet to solve [specific array/string manipulation problem] within 30 minutes.
Write an executable code snippet to solve [specific array/string manipulation problem] within 30 minutes.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Keep soft-deleted accounts from blocking re-registration
app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.
Approach
- Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
- Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
- For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
- State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.
Follow-up
- A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
- How do you honour an erasure request while resource_revision.actor_user_id still references this table?
Stop tag and share joins from fanning out a page
resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.
Approach
- Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
- Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
- Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
- Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.
Follow-up
- The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
- A resource can be shared with the same user twice under different permissions. Does your count change, and should it?
What are the four main principles of Object-Oriented Programming?
What are the four main principles of Object-Oriented Programming?
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 does indexing work in a relational database, and when would you avoid using it?
How does indexing work in a relational database, and when would you avoid using it?
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?
Describe the various transaction isolation levels in a DBMS.
Describe the various transaction isolation levels in a DBMS.
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?
Draw a high-level architectural diagram of the most recent application you built.
Draw a high-level architectural diagram of the most recent application you built.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
How would you design a database schema for a retail customer loyalty program?
How would you design a database schema for a retail customer loyalty program?
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?
Walk me through how you would build a RESTful API from scratch.
Walk me through how you would build a RESTful API from scratch.
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?
What factors do you consider when deciding between a relational and a NoSQL database for a new feature?
What factors do you consider when deciding between a relational and a NoSQL database for a new feature?
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?
Explain your approach to processing and transforming a massive dataset efficiently.
Explain your approach to processing and transforming a massive dataset 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?
p99 jumped on one listing filter while p50 stayed flat
After a release that added an owner_user_id filter to the resource listing, p99 rose from 90 ms to 1.9 s while p50 stayed at 40 ms. Traffic and row counts are unchanged. resource carries the index (tenant_id, status, updated_at DESC, resource_id DESC). The new query filters tenant_id and owner_user_id, orders by updated_at DESC, resource_id DESC, and takes 20 rows. On PostgreSQL, explain the shape of the regression, prove it from a query plan, and give the index you would add.
Approach
- Start from the shape. A flat p50 with a moved p99 means a subset of requests changed cost, not all of them, so the first job is naming the subset. Bucket the endpoint's latency by the tenant's row count; the natural hypothesis is that large tenants are a small share of requests and all of the tail.
- Get the plan for the new query on a large tenant with EXPLAIN (ANALYZE, BUFFERS). Expect an index scan over the tenant's range, a filter discarding most of it, then a Sort feeding the Limit, possibly reporting Sort Method: external merge Disk. Read actual rows on the scan node, not estimated.
- Explain why the existing index cannot serve it. A composite B-tree is seekable only as a left prefix, and with no equality predicate on status the scan cannot treat updated_at as an ordering, because rows in the tenant's range are ordered by status first. Everything matching must be read and sorted before LIMIT 20 can apply, so a tenant with 400,000 rows pays 400,000 rows to return 20.
- Add (tenant_id, owner_user_id, updated_at DESC, resource_id DESC). Equality on the first two columns leaves the index ordered by updated_at within that pair, so the plan becomes an index scan that stops after 20 rows with no Sort node. PostgreSQL can scan a B-tree backwards, so the DESC markers matter only if the two sort columns ever disagree in direction; keeping them explicit documents the order the keyset cursor depends on.
Follow-up
- The endpoint paginates with OFFSET. What does page 500 cost with your index, and what does the keyset version cost?
- How would you have caught this before release, given that a 10,000-row seed database produces the same plan shape at an unnoticeable cost?
Built from the rounds and topics dunnhumby candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the dunnhumby loop
- Write out the reported sequence: Recruiter Phone Screen, Online Assessment, Technical Rounds, Managerial Interview.
- 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.
02Work Software Engineering
- Spend the session on Software Engineering, which dunnhumby candidates report being tested on.
- Write one worked example in Software Engineering and time yourself on it.
Deliverable: One timed worked example in Software Engineering.
03Work Coding Interviews
- Spend the session on Coding Interviews, which dunnhumby candidates report being tested on.
- Write one worked example in Coding Interviews and time yourself on it.
Deliverable: One timed worked example in Coding Interviews.
04Work Problem Solving Under Time Constraints
- Spend the session on Problem Solving Under Time Constraints, which dunnhumby candidates report being tested on.
- Write one worked example in Problem Solving Under Time Constraints and time yourself on it.
Deliverable: One timed worked example in Problem Solving Under Time Constraints.
05Answer out loud: Core CS Fundamentals
- Answer aloud, timed: What are the four main principles of Object-Oriented Programming?
- Answer aloud, timed: Can you explain the difference between a process and a thread in an Operating System?
Deliverable: Spoken answers to 2 reported Core CS Fundamentals question(s), under time.
06Answer out loud: Coding and Algorithms
- Answer aloud, timed: Write a program to implement a basic sorting algorithm and explain its time complexity.
- Answer aloud, timed: Given a string, write a function to find the first non-repeating character.
Deliverable: Spoken answers to 2 reported Coding and Algorithms question(s), under time.
07Answer out loud: Architecture and Data Modeling
- Answer aloud, timed: Draw a high-level architectural diagram of the most recent application you built.
- Answer aloud, timed: How would you design a database schema for a retail customer loyalty program?
Deliverable: Spoken answers to 2 reported Architecture and Data Modeling 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.
How do you resolve merge conflicts in Git, and what is your preferred branching strategy?
How do you resolve merge conflicts in Git, and what is your preferred branching strategy?
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 precision issues when working with floating-point numbers in financial or retail data?
How do you handle precision issues when working with floating-point numbers in financial or retail data?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Tell me about yourself and your journey as a software engineer.
Tell me about yourself and your journey as a software engineer.
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?
Describe a time when you had to explain a complex technical concept to a non-technical stakeholder.
Describe a time when you had to explain a complex technical concept to a non-technical stakeholder.
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 situations where a team member disagrees with your technical approach?
How do you handle situations where a team member disagrees with your technical approach?
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 identified a major flaw in a system and how you went about fixing it.
Tell me about a time you identified a major flaw in a system and how you went about fixing 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?
Describe a scenario where you had to meet a tight deadline without compromising code quality.
Describe a scenario where you had to meet a tight deadline without compromising code quality.
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
How do you resolve merge conflicts in Git, and what is your preferred branching strategy?
- 02
How do you handle precision issues when working with floating-point numbers in financial or retail data?
- 03
Tell me about yourself and your journey as a software engineer.
- 04
Describe a time when you had to explain a complex technical concept to a non-technical stakeholder.
How long does the entire interview process usually take?
The timeline can vary significantly. Be prepared for occasional delays between rounds and maintain polite, proactive communication with your recruiter.
dunnhumby Software Engineer candidate reports ↗Will I be required to do a take-home coding test?
Many teams at dunnhumby utilize a take-home test or an extended isolated coding session (often 2-3 hours). If assigned one, pay strict attention to the requirements, focus heavily on writing clean code, and prioritize Test-Driven Development (TDD), as this is heavily scrutinized.
dunnhumby Software Engineer candidate reports ↗Do I need a background in Data Science to succeed in this role?
No, you are not expected to be a data scientist. However, because dunnhumby is a data science company, having a strong understanding of data modeling, database management, and how to build systems that process large volumes of data will make you a much stronger candidate.
dunnhumby Software Engineer candidate reports ↗What is the format of the technical interviews?
Technical interviews can range from live problem-solving on platforms like HackerEarth to rapid-fire theoretical questions where interviewers might ask 30-40 CS fundamental questions in a 90-minute window. Flexibility and a broad understanding of core concepts are essential.
dunnhumby Software Engineer candidate reports ↗How should I prepare for the managerial round?
The managerial round often focuses on high-level system design, architecture, and your past experience. Be prepared to draw diagrams of systems you have worked on, explain your technical decisions, and answer competency-based behavioral questions using the STAR method.
dunnhumby Software Engineer candidate reports ↗What is the interview process at dunnhumby for a Software Engineer, and how many rounds should I expect?
For Software Engineer candidates at dunnhumby, the process typically includes a recruiter phone screen, an online assessment, technical rounds, and a managerial interview. The overall flow usually spans three to four distinct stages, depending on team dynamics. You should be ready to move quickly from logistics into a coding and CS-focused test, then into deeper technical and competency discussions.
dunnhumby Software Engineer candidate reports ↗How hard is the dunnhumby Software Engineer interview compared to other companies?
That suggests the bar is not usually described as extreme, but you still need solid fundamentals and confident problem-solving. Still, you should prepare for time pressure in live coding and explain your technical thinking clearly.
dunnhumby Software Engineer candidate reports ↗What does the online assessment test for a Software Engineer at dunnhumby?
The online assessment is a coding assessment hosted on platforms like HackerEarth. It is designed to test basic coding ability and computer science knowledge. Based on the topics that come up most often, expect focus on problem solving under time constraints and technical screening.
dunnhumby Software Engineer candidate reports ↗What technical topics are most likely tested for a Software Engineer at dunnhumby?
Commonly tested areas include core software engineering and coding interview skills, along with problem solving under time constraints and communication skills for technical explanations. The preparation guide also highlights core CS fundamentals like OOP, OS threads versus processes, and DBMS concepts, plus algorithmic coding practice and clean, testable solutions. For system-focused parts, you should be ready for architecture and data modeling, including processing and transforming massive datasets and take-home assignment style work.
dunnhumby Software Engineer candidate reports ↗Does dunnhumby Software Engineer include take-home assignments, and how should I prepare for that?
Yes, take-home assignments are listed as a recurring topic for the Software Engineer interview experience. The guide also explicitly notes you may demonstrate Test-Driven Development (TDD) by explaining how you would structure a take-home assignment for that goal. Prioritize building clean, testable code and showing how you would validate edge cases, not just making the solution work.
dunnhumby Software Engineer candidate reports ↗What is the pay for a Software Engineer at dunnhumby, and how is it reported?
The provided materials do not include specific compensation figures for dunnhumby Software Engineer roles. If you have access to a job posting or offer details for your target location and level, treat pay as varying by level and location.
dunnhumby 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.
- 01dunnhumby 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.