Wix Interview Questions — 57 DSA Problems

51 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Wix LeetCode questions for software engineering interviews.

• Integer to Roman (MEDIUM) — Hash Table, Math, String
• Merge Intervals (MEDIUM) — Array, Sorting
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy
• Add Two Numbers (MEDIUM) — Linked List, Math, Recursion
• Unique Email Addresses (EASY) — Array, Hash Table, String
• Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree
• All Nodes Distance K in Binary Tree (MEDIUM) — Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Clone Graph (MEDIUM) — Hash Table, Depth-First Search, Breadth-First Search, Graph
• Is Subsequence (EASY) — Two Pointers, String, Dynamic Programming
• Employees Earning More Than Their Managers (EASY) — Database
• Verifying an Alien Dictionary (EASY) — Array, Hash Table, String
• Binary Tree Right Side View (MEDIUM) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Longest String Chain (MEDIUM) — Array, Hash Table, Two Pointers, String, Dynamic Programming, Sorting
• Lowest Common Ancestor of a Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Shortest Word Distance (EASY) — Array, String
• K Closest Points to Origin (MEDIUM) — Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect
• Invalid Transactions (MEDIUM) — Array, Hash Table, String, Sorting
• Group Shifted Strings (MEDIUM) — Array, Hash Table, String
• Search Suggestions System (MEDIUM) — Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)
• Copy List with Random Pointer (MEDIUM) — Hash Table, Linked List
• Validate Binary Search Tree (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Design HashSet (EASY) — Array, Hash Table, Linked List, Design, Hash Function
• Intersection of Two Arrays (EASY) — Array, Hash Table, Two Pointers, Binary Search, Sorting
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• Merge Two Sorted Lists (EASY) — Linked List, Recursion
• Move Zeroes (EASY) — Array, Two Pointers
• Diameter of Binary Tree (EASY) — Tree, Depth-First Search, Binary Tree
• Minimum Distance Between BST Nodes (EASY) — Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Alien Dictionary (HARD) — Array, String, Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Pow(x, n) (MEDIUM) — Math, Recursion
• Unique Morse Code Words (EASY) — Array, Hash Table, String
• Subdomain Visit Count (MEDIUM) — Array, Hash Table, String, Counting
• Palindrome Pairs (HARD) — Array, Hash Table, String, Trie
• Power of Four (EASY) — Math, Bit Manipulation, Recursion
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• Strong Password Checker (HARD) — String, Greedy, Heap (Priority Queue)
• Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix
• Decode String (MEDIUM) — String, Stack, Recursion
• Subsets (MEDIUM) — Array, Backtracking, Bit Manipulation
• Word Search II (HARD) — Array, String, Backtracking, Trie, Matrix
• Roman to Integer (EASY) — Hash Table, Math, String
• Escape The Ghosts (MEDIUM) — Array, Math
• As Far from Land as Possible (MEDIUM) — Array, Dynamic Programming, Breadth-First Search, Matrix
• Reconstruct Original Digits from English (MEDIUM) — Hash Table, Math, String
• Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix
• Find Peak Element (MEDIUM) — Array, Binary Search