cswork / libraryOpen practice workspace

Interview guides · Wix

Wix Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Wix, you play a pivotal role in shaping the future of web development for millions of users worldwide. This position is integral to our mission of empowering individuals and businesses to create and manage their online presence with ease and creativity. You'll contribute to innovative products and solutions that enhance user experience while tackling complex technical challenges. Your work impacts various products across the Wix ecosystem, from enhancing website functionality to improving backend performance and user interface design. Collaborating with cross-functional teams, you will drive projects that directly influence how users interact with our platform, ensuring that we remain at the forefront of web technology. This role is not just about coding; it's about creating seamless experiences and making a tangible difference in the lives of our users.

This guide is scoped to a Software Engineer candidate at Wix.

Focus areas

  • JavaScript
  • Coding Interviews
  • System Design

The Wix interview process

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

Initial Screening Call

The process begins with a screening call to assess the candidate's background and fit for the role.

What to demonstrate

  • The process begins with a screening call to assess the candidate's background and fit for the role
  • Depth in JavaScript

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 Interview

This interview may include coding challenges, discussions about past projects, and system design scenarios.

What to demonstrate

  • This interview may include coding challenges, discussions about past projects, and system design scenarios
  • Depth in JavaScript

How to prepare

  • Answer aloud and timed: Write a function that recursively computes the nth Fibonacci number. What are the implications of your approach?
  • Answer aloud and timed: How would you optimize an algorithm that processes a large dataset?

Final HR Interview

The final interview focuses on cultural fit and expectations within the company.

What to demonstrate

  • The final interview focuses on cultural fit and expectations within the company
  • Depth in JavaScript

How to prepare

  • Answer aloud and timed: Explain the difference between synchronous and asynchronous programming in JavaScript.
  • Answer aloud and timed: Design a URL shortening service. What are the key components and considerations?

Where candidates lose points

Practice Coding

Regularly solve coding problems on platforms like LeetCode to sharpen your skills.

Understand the Company

Familiarize yourself with Wix's products and services to tailor your answers during interviews.

Prepare for Behavioral Questions

Reflect on your past experiences and be ready to discuss them in detail.

Ask Questions

Show your interest in the role and company by asking insightful questions during the interview.

Questions & practice

How would you implement a function to find the minimal positive integer not occurring in a given sequence?

Medium · Technical / Coding Questions

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?

Can you explain the concept of closures in JavaScript and provide an example?

Medium · Technical / Coding Questions

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. 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 function that recursively computes the nth Fibonacci number. What are the implications of your approac

Medium · Technical / Coding Questions

Write a function that recursively computes the nth Fibonacci number. What are the implications of your approach?

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?

How would you optimize an algorithm that processes a large dataset?

Medium · Technical / Coding Questions

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?

Explain the difference between synchronous and asynchronous programming in JavaScript.

Medium · Technical / Coding Questions

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. 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?

Replace offset paging on the resource feed with keyset

Easy · keyset pagination · composite index · sort order

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

  1. 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.
  2. 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.
  3. 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.
  4. 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?

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?

Design a URL shortening service. What are the key components and considerations?

Medium · System Design / Architecture

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?

How would you architect a system to handle millions of concurrent users? Describe your thought process.

Medium · System Design / Architecture

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?

Discuss how you would design a real-time chat application. What technologies would you use and why?

Medium · System Design / Architecture

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?

You need to improve the performance of a web application. What steps would you take?

Medium · Problem-Solving / Case Studies

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?

If a user reports that their website is loading slowly, how would you troubleshoot the issue?

Medium · Problem-Solving / Case Studies

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. 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?

Suggested practice checklist

Built from the rounds and topics Wix candidates report.

Day 1 — Map the Wix loop

  • Write out the reported sequence: Initial Screening Call, Technical Interview, Final HR 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 3 reported rounds, with the weakest marked.

Day 2 — Work JavaScript

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

Deliverable: One timed worked example in JavaScript.

Day 3 — Work Coding Interviews

  • Spend the session on Coding Interviews, which Wix 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.

Day 4 — Work System Design

  • Spend the session on System Design, which Wix 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.

Day 5 — Answer out loud: Technical / Coding Questions

  • Answer aloud, timed: How would you implement a function to find the minimal positive integer not occurring in a given sequence?
  • Answer aloud, timed: Can you explain the concept of closures in JavaScript and provide an example?

Deliverable: Spoken answers to 2 reported Technical / Coding Questions question(s), under time.

Day 6 — Answer out loud: System Design / Architecture

  • Answer aloud, timed: Design a URL shortening service. What are the key components and considerations?
  • Answer aloud, timed: How would you architect a system to handle millions of concurrent users? Describe your thought process.

Deliverable: Spoken answers to 2 reported System Design / Architecture question(s), under time.

Day 7 — Answer out loud: Behavioral / Leadership

  • Answer aloud, timed: Describe a time when you faced a significant obstacle in a project. How did you approach it?
  • Answer aloud, timed: How do you prioritize tasks when faced with multiple deadlines?

Deliverable: Spoken answers to 2 reported Behavioral / Leadership question(s), under time.

Behavioural preparation

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

Describe a time when you faced a significant obstacle in a project. How did you approach it?

Medium · Behavioral / Leadership

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?

How do you prioritize tasks when faced with multiple deadlines?

Medium · Behavioral / Leadership

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?

Can you provide an example of how you worked with a team to achieve a common goal?

Medium · Behavioral / Leadership

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?