Wix interview questions¶
The most frequent LeetCode problems tagged to Wix. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 0 distinct problems tagged to Wix in the last 6 months (0 in the last 30 days, 0 in the last 3 months, 55 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Merge Intervals | Medium | Older | Array, Sorting, Quicksort |
| 2 | Number of Islands | Medium | Older | Array, Depth-First Search, Breadth-First Search, Union-Find |
| 3 | Container With Most Water | Medium | Older | Array, Two Pointers, Greedy |
| 4 | Integer to Roman | Medium | Older | Hash Table, Math, String |
| 5 | Rotting Oranges | Medium | Older | Array, Breadth-First Search, Matrix |
| 6 | 3Sum | Medium | Older | Array, Two Pointers, Sorting |
| 7 | Add Two Numbers | Medium | Older | Linked List, Math, Recursion |
| 8 | Alien Dictionary | Hard | Older | Array, String, Depth-First Search, Breadth-First Search |
| 9 | All Nodes Distance K in Binary Tree | Medium | Older | Hash Table, Tree, Depth-First Search, Breadth-First Search |
| 10 | Binary Tree Maximum Path Sum | Hard | Older | Dynamic Programming, Tree, Depth-First Search, Binary Tree |
| 11 | Binary Tree Right Side View | Medium | Older | Tree, Depth-First Search, Breadth-First Search, Binary Tree |
| 12 | Clone Graph | Medium | Older | Hash Table, Depth-First Search, Breadth-First Search, Graph Theory |
| 13 | Copy List with Random Pointer | Medium | Older | Hash Table, Linked List |
| 14 | Design HashSet | Easy | Older | Array, Hash Table, Linked List, Design |
| 15 | Diameter of Binary Tree | Easy | Older | Tree, Depth-First Search, Binary Tree, DP on Trees |
| 16 | Group Shifted Strings | Medium | Older | Array, Hash Table, String |
| 17 | Intersection of Two Arrays | Easy | Older | Array, Hash Table, Two Pointers, Binary Search |
| 18 | Invalid Transactions | Medium | Older | Array, Hash Table, String, Sorting |
| 19 | Is Subsequence | Easy | Older | Two Pointers, String, Dynamic Programming |
| 20 | K Closest Points to Origin | Medium | Older | Array, Math, Divide and Conquer, Geometry |
| 21 | Longest Palindromic Substring | Medium | Older | Two Pointers, String, Dynamic Programming, Manacher |
| 22 | Longest String Chain | Medium | Older | Array, Hash Table, Two Pointers, String |
| 23 | Lowest Common Ancestor of a Binary Tree | Medium | Older | Tree, Depth-First Search, Binary Tree, Binary Lifting |
| 24 | Maximum Subarray | Medium | Older | Array, Divide and Conquer, Dynamic Programming |
| 25 | Merge Two Sorted Lists | Easy | Older | Linked List, Recursion |
| 26 | Minimum Distance Between BST Nodes | Easy | Older | Tree, Depth-First Search, Breadth-First Search, Binary Search Tree |
| 27 | Move Zeroes | Easy | Older | Array, Two Pointers |
| 28 | Palindrome Pairs | Hard | Older | Array, Hash Table, String, Trie |
| 29 | Pow(x, n) | Medium | Older | Math, Recursion |
| 30 | Power of Four | Easy | Older | Math, Bit Manipulation, Recursion |
| 31 | Search Suggestions System | Medium | Older | Array, String, Binary Search, Trie |
| 32 | Shortest Word Distance | Easy | Older | Array, String |
| 33 | Strong Password Checker | Hard | Older | String, Greedy, Heap (Priority Queue) |
| 34 | Subdomain Visit Count | Medium | Older | Array, Hash Table, String, Counting |
| 35 | Trapping Rain Water | Hard | Older | Array, Two Pointers, Dynamic Programming, Stack |
| 36 | Unique Email Addresses | Easy | Older | Array, Hash Table, String |
| 37 | Unique Morse Code Words | Easy | Older | Array, Hash Table, String |
| 38 | Validate Binary Search Tree | Medium | Older | Tree, Depth-First Search, Binary Search Tree, Binary Tree |
| 39 | Verifying an Alien Dictionary | Easy | Older | Array, Hash Table, String |
| 40 | Decode String | Medium | Older | String, Stack, Recursion |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies