Wix coding interview
questions, leaked.
57 problems reported across recent Wix interviews. Top patterns: array, string, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Wix's coding interview hits you with 57 problems across their assessment, split 17 easy, 31 medium, 9 hard. Arrays dominate at 33 problems, followed by strings at 22 and hash-tables at 18. If you're prepping, you're looking at a medium-heavy bar where tree and graph traversal show up hard enough to matter. The good news: most of the pattern work is standard. The hedge: if you blank on an array or string variant mid-assessment, StealthCoder runs invisibly during your screen share and surfaces a working solution in seconds.
Top problems at Wix
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Integer to Roman | MEDIUM | 100.0 | 69% | Hash Table · Math · String |
| 02 | Merge Intervals | MEDIUM | 91.3 | 49% | Array · Sorting |
| 03 | Number of Islands | MEDIUM | 91.3 | 62% | Array · Depth-First Search · Breadth-First Search |
| 04 | Container With Most Water | MEDIUM | 89.1 | 58% | Array · Two Pointers · Greedy |
| 05 | Longest Palindromic Substring | MEDIUM | 89.1 | 36% | Two Pointers · String · Dynamic Programming |
| 06 | K Closest Points to Origin | MEDIUM | 86.7 | 68% | Array · Math · Divide and Conquer |
| 07 | Validate Binary Search Tree | MEDIUM | 86.7 | 34% | Tree · Depth-First Search · Binary Search Tree |
| 08 | Longest String Chain | MEDIUM | 86.7 | 62% | Array · Hash Table · Two Pointers |
| 09 | Lowest Common Ancestor of a Binary Tree | MEDIUM | 86.7 | 67% | Tree · Depth-First Search · Binary Tree |
| 10 | Shortest Word Distance | EASY | 86.7 | 66% | Array · String |
| 11 | Search Suggestions System | MEDIUM | 86.7 | 65% | Array · String · Binary Search |
| 12 | All Nodes Distance K in Binary Tree | MEDIUM | 86.7 | 66% | Hash Table · Tree · Depth-First Search |
| 13 | Invalid Transactions | MEDIUM | 86.7 | 31% | Array · Hash Table · String |
| 14 | Group Shifted Strings | MEDIUM | 86.7 | 67% | Array · Hash Table · String |
| 15 | Binary Tree Maximum Path Sum | HARD | 86.7 | 41% | Dynamic Programming · Tree · Depth-First Search |
| 16 | Intersection of Two Arrays | EASY | 86.7 | 76% | Array · Hash Table · Two Pointers |
| 17 | Verifying an Alien Dictionary | EASY | 86.7 | 56% | Array · Hash Table · String |
| 18 | Binary Tree Right Side View | MEDIUM | 86.7 | 67% | Tree · Depth-First Search · Breadth-First Search |
| 19 | Power of Four | EASY | 86.7 | 49% | Math · Bit Manipulation · Recursion |
| 20 | Diameter of Binary Tree | EASY | 86.7 | 64% | Tree · Depth-First Search · Binary Tree |
| 21 | Add Two Numbers | MEDIUM | 86.7 | 46% | Linked List · Math · Recursion |
| 22 | Clone Graph | MEDIUM | 86.7 | 62% | Hash Table · Depth-First Search · Breadth-First Search |
| 23 | Is Subsequence | EASY | 86.7 | 48% | Two Pointers · String · Dynamic Programming |
| 24 | Copy List with Random Pointer | MEDIUM | 86.7 | 61% | Hash Table · Linked List |
| 25 | Alien Dictionary | HARD | 86.7 | 37% | Array · String · Depth-First Search |
| 26 | 3Sum | MEDIUM | 86.7 | 37% | Array · Two Pointers · Sorting |
| 27 | Merge Two Sorted Lists | EASY | 86.7 | 67% | Linked List · Recursion |
| 28 | Move Zeroes | EASY | 86.7 | 63% | Array · Two Pointers |
| 29 | Minimum Distance Between BST Nodes | EASY | 86.7 | 60% | Tree · Depth-First Search · Breadth-First Search |
| 30 | Palindrome Pairs | HARD | 86.7 | 36% | Array · Hash Table · String |
| 31 | Trapping Rain Water | HARD | 86.7 | 65% | Array · Two Pointers · Dynamic Programming |
| 32 | Design HashSet | EASY | 86.7 | 67% | Array · Hash Table · Linked List |
| 33 | Pow(x, n) | MEDIUM | 86.7 | 37% | Math · Recursion |
| 34 | Maximum Subarray | MEDIUM | 86.7 | 52% | Array · Divide and Conquer · Dynamic Programming |
| 35 | Employees Earning More Than Their Managers | EASY | 86.7 | 72% | Database |
| 36 | Unique Morse Code Words | EASY | 86.7 | 83% | Array · Hash Table · String |
| 37 | Subdomain Visit Count | MEDIUM | 86.7 | 77% | Array · Hash Table · String |
| 38 | Unique Email Addresses | EASY | 86.7 | 68% | Array · Hash Table · String |
| 39 | Median of Two Sorted Arrays | HARD | 84.1 | 44% | Array · Binary Search · Divide and Conquer |
| 40 | Strong Password Checker | HARD | 81.1 | 15% | String · Greedy · Heap (Priority Queue) |
| 41 | Rotting Oranges | MEDIUM | 81.1 | 57% | Array · Breadth-First Search · Matrix |
| 42 | Decode String | MEDIUM | 77.8 | 61% | String · Stack · Recursion |
| 43 | Subsets | MEDIUM | 69.4 | 81% | Array · Backtracking · Bit Manipulation |
| 44 | Roman to Integer | EASY | 69.4 | 65% | Hash Table · Math · String |
| 45 | Word Search II | HARD | 69.4 | 37% | Array · String · Backtracking |
| 46 | As Far from Land as Possible | MEDIUM | 63.8 | 52% | Array · Dynamic Programming · Breadth-First Search |
| 47 | Escape The Ghosts | MEDIUM | 63.8 | 63% | Array · Math |
| 48 | Reconstruct Original Digits from English | MEDIUM | 63.8 | 52% | Hash Table · Math · String |
| 49 | Word Search | MEDIUM | 56.6 | 45% | Array · String · Backtracking |
| 50 | Shortest Distance from All Buildings | HARD | 46.6 | 44% | Array · Breadth-First Search · Matrix |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Wix OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array33 · 58%
- string22 · 39%
- hash table18 · 32%
- depth first search11 · 19%
- breadth first search10 · 18%
- two pointers9 · 16%
- dynamic programming8 · 14%
- math8 · 14%
- tree8 · 14%
- binary tree8 · 14%
Array and string problems form the backbone of Wix's assessment, accounting for 55 of the 57 total problems between them. Depth-first search and breadth-first-search each appear around 10-11 times, so graph traversal isn't an afterthought. Medium difficulty dominates (31 problems), meaning you'll face tricky constraints or multi-step logic on most problems you see. Problems like Merge Intervals, Container With Most Water, and Number of Islands test whether you can optimize past a naive approach. Hash-table appears on 18 problems and often pairs with string or array work. The hard problems sit at 9 and lean toward dynamic-programming and trees (Binary Tree Maximum Path Sum is a classic). Drill arrays and strings first, get comfortable with two-pointers and sorting, then ensure you can traverse trees and grids under pressure. StealthCoder becomes your safety net on the live OA if a medium-hard variant doesn't yield to your approach in the first few minutes.
Companies with similar patterns
If you prepped for Wix, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Wix.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Wix interview FAQ
Should I drill all 33 array problems before strings?+
No. Arrays and strings are both primary at Wix, and they often overlap (see Longest Palindromic Substring, Group Shifted Strings). Alternate between them. Get solid on two-pointers and sorting first, since those appear across both categories. You'll hit diminishing returns drilling the 15th similar array problem.
How much graph traversal do I need to know?+
BFS and DFS each show up 10-11 times out of 57 problems. That's roughly 20 percent of the assessment. You won't pass without it. Validate Binary Search Tree and Number of Islands are likely candidates. Know both recursive and iterative DFS, and be comfortable building an adjacency list or matrix representation on the fly.
Is 7 sorting problems enough to skip sorting practice?+
No. Sorting appears on 7 problems, but it also pairs with array and string work (Merge Intervals, K Closest Points to Origin, Longest String Chain). It's not just sorting from scratch. You need to sort and then apply greedy or sliding window logic. Don't skip it.
What's my first move if I see a hard problem live?+
Read the problem twice. Look for dynamic-programming or tree patterns (hard problems at Wix trend that way). Sketch a brute-force solution first. If you're stuck past 2-3 minutes and can't spot the optimization, that's where StealthCoder steps in invisibly and gives you a direction or full solution so you don't crater.
Is medium difficulty really the bottleneck?+
Yes. 31 of 57 problems are medium, and that's where most candidates stall. Easy ones you'll likely pass. Hard ones are pass-or-fail bets. Medium is where you prove you can optimize and avoid off-by-one bugs under time pressure. That's where the majority of your prep time should live.