Wix Coding Interview Questions

Integer to Roman

Seven different symbols represent Roman numerals with the following values:

Number of Islands

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.

Merge Intervals

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...

Longest Palindromic Substring

Given a string s, return the longest palindromic substring in s.

Container With Most Water

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Unique Morse Code Words

International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows:

Minimum Distance Between BST Nodes

Given the root of a Binary Search Tree (BST), return the minimum difference between the values of any two different nodes in the tree.

Add Two Numbers

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a sing...

Design HashSet

Design a HashSet without using any built-in hash table libraries.

Is Subsequence

Given two strings s and t, return true if s is a subsequence of t, or false otherwise.

Pow(x, n)

Implement pow(x, n), which calculates x raised to the power n (i.e., xn).

Binary Tree Right Side View

Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Merge Two Sorted Lists

You are given the heads of two sorted linked lists list1 and list2.

Clone Graph

Given a reference of a node in a connected undirected graph.

Unique Email Addresses

Every valid email consists of a local name and a domain name, separated by the '@' sign. Besides lowercase letters, the email may contain one or more '.' or '+'...

Invalid Transactions

A transaction is possibly invalid if:

3Sum

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.

Maximum Subarray

Given an integer array nums, find the subarray with the largest sum, and return its sum.

Intersection of Two Arrays

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any...

All Nodes Distance K in Binary Tree

Given the root of a binary tree, the value of a target node target, and an integer k, return an array of the values of all nodes that have a distance k from the...

Copy List with Random Pointer

A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.

Subdomain Visit Count

A website domain "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcode.com" and at the lo...

Employees Earning More Than Their Managers

Table: Employee

Validate Binary Search Tree

Given the root of a binary tree, determine if it is a valid binary search tree (BST).

Verifying an Alien Dictionary

In an alien language, surprisingly, they also use English lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of...

Move Zeroes

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Palindrome Pairs

You are given a 0-indexed array of unique strings words.

Power of Four

Given an integer n, return true if it is a power of four. Otherwise, return false.

Search Suggestions System

You are given an array of strings products and a string searchWord.

Binary Tree Maximum Path Sum

A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequ...

K Closest Points to Origin

Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane and an integer k, return the k closest points to the origin (0, 0).

Longest String Chain

You are given an array of words where each word consists of lowercase English letters.

Lowest Common Ancestor of a Binary Tree

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

Diameter of Binary Tree

Given the root of a binary tree, return the length of the diameter of the tree.

Median of Two Sorted Arrays

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

Strong Password Checker

A password is considered strong if the below conditions are all met:

Rotting Oranges

You are given an m x n grid where each cell can have one of three values:

Decode String

Given an encoded string, return its decoded string.

Word Search II

Given an m x n board of characters and a list of strings words, return all words on the board.

Roman to Integer

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Subsets

Given an integer array nums of unique elements, return all possible subsets (the power set).

Reconstruct Original Digits from English

Given a string s containing an out-of-order English representation of digits 0-9, return the digits in ascending order.

As Far from Land as Possible

Given an n x n grid containing only values 0 and 1, where 0 represents water and 1 represents land, find a water cell such that its distance to the nearest land...

Escape The Ghosts

You are playing a simplified PAC-MAN game on an infinite 2-D grid. You start at the point [0, 0], and you are given a destination point target = [xtarget, ytarg...

Word Search

Given an m x n grid of characters board and a string word, return true if word exists in the grid.

Find Peak Element

A peak element is an element that is strictly greater than its neighbors.

Pascal's Triangle

Given an integer numRows, return the first numRows of Pascal's triangle.

Valid Parentheses

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

Two Sum

Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.

Count and Say

The count-and-say sequence is a sequence of digit strings defined by the recursive formula: