As a Software Engineer at Whatsapp, you are at the heart of one of the world’s most significant communication platforms. Your work directly impacts billions of users, ensuring that messages, calls, and media are delivered with extreme reliability, security, and speed. You are not just writing code; you are maintaining a massive, high-concurrency infrastructure that operates at a scale few companies on the planet ever reach. The role is defined by its focus on technical rigor and efficiency. Whatsapp is known for its lean, high-output culture, where engineers are expected to have a deep understanding of the entire stack—from low-level networking protocols and memory management to the nuances of distributed systems. Whether you are optimizing message delivery pipelines or architecting new features, you are expected to solve complex problems that require both broad architectural vision and precise, bug-free implementation.
Recruiter Screen
reportedInitial screening by a recruiter to evaluate candidate fit for the role.
What to demonstrate
- Initial screening by a recruiter to evaluate candidate fit for the role
- Depth in Data Structures
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 Assessments
reportedIncludes remote coding challenges, phone screens, or on-campus interviews.
What to demonstrate
- Includes remote coding challenges, phone screens, or on-campus interviews
- Depth in Data Structures
How to prepare
- Answer aloud and timed: How would you detect and recover a linked list that contains a loop?
- Answer aloud and timed: What are the time and space complexity trade-offs when using a hash table versus a balanced binary search tree for a dictionary implementation?
Full Loop Interviews
reportedBack-to-back interviews covering coding, system design, collaboration, and troubleshooting.
What to demonstrate
- Back-to-back interviews covering coding, system design, collaboration, and troubleshooting
- Depth in Data Structures
How to prepare
- Answer aloud and timed: How would you convert a sorted linked list into a binary search tree?
- Answer aloud and timed: How would you design a strategy to calculate the median delivery time for 100 billion messages?
PracHub editorial advice for the preparation topics above.
Treat recruiter advice as gospel
If your recruiter provides specific topics or practice questions, treat them as the highest priority. They are invested in your success and are providing you with the most accurate preview of your loop.
Be ready for "surprise" questions
Some interviewers may jump straight into technical challenges. Stay calm, take a moment to clarify the problem, and start by outlining your approach.
Communicate your trade-offs
Whenever you choose a data structure or an algorithm, explicitly state why you chose it over the alternatives. Showing that you understand the "why" is just as important as the code itself.
Focus on the fundamentals
Don't get distracted by the latest frameworks. Ensure your knowledge of foundational concepts like pointers, memory management, and networking is rock-solid.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
How would you implement a linked list with operations like prepend, reverse, and specific runtime requirements
How would you implement a linked list with operations like prepend, reverse, and specific runtime requirements?
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?
Can you convert a recursive algorithm into an iterative one, and explain the differences in memory usage?
Can you convert a recursive algorithm into an iterative one, and explain the differences in memory usage?
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?
How would you detect and recover a linked list that contains a loop?
How would you detect and recover a linked list that contains a loop?
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?
What are the time and space complexity trade-offs when using a hash table versus a balanced binary search tree
What are the time and space complexity trade-offs when using a hash table versus a balanced binary search tree for a dictionary implementation?
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 convert a sorted linked list into a binary search tree?
How would you convert a sorted linked list into a binary search 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?
How do you optimize code to handle millions of concurrent requests while minimizing memory overhead?
How do you optimize code to handle millions of concurrent requests while minimizing memory overhead?
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?
Denormalise tenant onto revisions and backfill it live
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
- 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.
- 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.
- 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.
- 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?
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?
How would you design a strategy to calculate the median delivery time for 100 billion messages?
How would you design a strategy to calculate the median delivery time for 100 billion messages?
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?
What are the fundamental differences between TCP and UDP, and in what scenarios would you choose one over the
What are the fundamental differences between TCP and UDP, and in what scenarios would you choose one over the other for messaging?
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 system to handle message compression or process Unicode data efficiently?
How would you design a system to handle message compression or process Unicode 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?
What considerations are necessary when designing a data structure for a high-traffic server environment?
What considerations are necessary when designing a data structure for a high-traffic server environment?
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?
Why do you use Whatsapp, and how does it compare to other messaging platforms in terms of architecture or user
Why do you use Whatsapp, and how does it compare to other messaging platforms in terms of architecture or user experience?
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 do you approach debugging a production issue when you have limited visibility?
How do you approach debugging a production issue when you have limited visibility?
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 Whatsapp candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Whatsapp loop
- Write out the reported sequence: Recruiter Screen, Technical Assessments, Full Loop 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 Data Structures
- Spend the session on Data Structures, which Whatsapp candidates report being tested on.
- Write one worked example in Data Structures and time yourself on it.
Deliverable: One timed worked example in Data Structures.
03Work Big O Notation
- Spend the session on Big O Notation, which Whatsapp candidates report being tested on.
- Write one worked example in Big O Notation and time yourself on it.
Deliverable: One timed worked example in Big O Notation.
04Work Linked List Implementation
- Spend the session on Linked List Implementation, which Whatsapp candidates report being tested on.
- Write one worked example in Linked List Implementation and time yourself on it.
Deliverable: One timed worked example in Linked List Implementation.
05Answer out loud: Data Structures and Algorithms
- Answer aloud, timed: How would you implement a linked list with operations like prepend, reverse, and specific runtime requirements?
- Answer aloud, timed: Can you convert a recursive algorithm into an iterative one, and explain the differences in memory usage?
Deliverable: Spoken answers to 2 reported Data Structures and Algorithms question(s), under time.
06Answer out loud: System Design and Architecture
- Answer aloud, timed: How would you design a strategy to calculate the median delivery time for 100 billion messages?
- Answer aloud, timed: What are the fundamental differences between TCP and UDP, and in what scenarios would you choose one over the other for messaging?
Deliverable: Spoken answers to 2 reported System Design and Architecture question(s), under time.
07Answer out loud: Behavioral and Project-Based
- Answer aloud, timed: Can you walk me through a complex project you have worked on and the specific technical hurdles you overcame?
- Answer aloud, timed: What is your experience with socket programming, memory management, or Linux kernel internals?
Deliverable: Spoken answers to 2 reported Behavioral and Project-Based 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.
Can you walk me through a complex project you have worked on and the specific technical hurdles you overcame?
Can you walk me through a complex project you have worked on and the specific technical hurdles you overcame?
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?
What is your experience with socket programming, memory management, or Linux kernel internals?
What is your experience with socket programming, memory management, or Linux kernel internals?
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?
Turn a code review disagreement into a decision
A colleague's change updates a row with UPDATE resource SET version = version + 1 WHERE resource_id = $1 AND version = $2 and treats an affected-row count of zero as a successful no-op. You read that as a silently lost update; they think returning 200 is friendlier to clients than returning a conflict. Describe how you have handled a review disagreement of this shape: what goes in the comment, when you leave the thread, and who decides. Then write the comment you would leave here, in under 80 words.
Approach
- Sort the disagreement before writing anything. A silently discarded write is a correctness claim about data; the choice between 409 and 412 is taste. Only the first justifies blocking a merge, and saying which one you are doing is most of the value of the comment.
- Make the claim reproducible in the comment itself with an interleaving rather than a principle: A reads version 7, B reads version 7, B commits version 8, A's predicate matches zero rows, A is told it succeeded and A's edit is gone.
- Offer the alternative with its cost attached: return 409 carrying the current version and the revision that won, so the client can re-read and re-apply. Note that automatic retry is not the fix, because a retry re-reads the winner's state and reapplies an intent formed against data that no longer exists.
- Apply an escalation rule you can state: two round trips on the thread, then a call, and the service's owner decides rather than the reviewer. A reviewer who cannot be overruled is a bottleneck with extra steps.
Follow-up
- Where would you put the test that fails if someone reintroduces the swallowed zero rowcount?
- The author says clients cannot handle a 409. How do you check whether that is true?
- 01
Can you walk me through a complex project you have worked on and the specific technical hurdles you overcame?
- 02
What is your experience with socket programming, memory management, or Linux kernel internals?
- 03
A colleague's change updates a row with UPDATE resource SET version = version + 1 WHERE resource_id = $1 AND version = $2 and treats an affected-row count of zero as a successful no-op. You read that as a silently lost update; they think returning 200 is friendlier to clients than returning a conflict. Describe how you have handled a review disagreement of this shape: what goes in the comment, when you leave the thread, and who decides. Then write the comment you would leave here, in under 80 words.
How long should I prepare for the interview?
Because the technical bar is high, most candidates spend several weeks reviewing data structures and algorithms, as well as practicing system design. Use the time to become "rusty-proof" with your coding skills so you can focus on the problem-solving logic during the interview.
Whatsapp Software Engineer candidate reports ↗What is the most important factor in passing?
Precision. Whatsapp interviewers look for candidates who can produce correct, efficient solutions on the first or second attempt. Avoid guessing; instead, communicate your thought process clearly and ensure you have considered edge cases before finalizing your code.
Whatsapp Software Engineer candidate reports ↗How are remote or virtual interviews handled?
You will likely use collaborative coding environments like Coderpad or video conferencing tools. Ensure you are familiar with these platforms beforehand so that technical issues do not distract from your performance.
Whatsapp Software Engineer candidate reports ↗What topics does Whatsapp test in interviews?
Whatsapp interviews most often cover Data Structures, Visual Design (UI Styling), Big O Notation, Portfolio Presentation, and Linked List Implementation. The exact emphasis depends on the specific role you apply for.
Whatsapp Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
Official role evidence, timestamped platform data and clearly labeled preparation advice.
- 01Whatsapp 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.
Zebra Technologies Software Engineer Interview Guide
What Zebra Technologies asks Software Engineer candidates, from reported rounds and questions.
William Blair Software Engineer Interview Guide
What William Blair asks Software Engineer candidates, from reported rounds and questions.
WyzAnt Software Engineer Interview Guide
What WyzAnt asks Software Engineer candidates, from reported rounds and questions.
Vodafone Software Engineer Interview Guide
What Vodafone asks Software Engineer candidates, from reported rounds and questions.