Watch others solve Search interview questions, see how they did, and learn from their mistakes.
Get step-by-step instructions on how to approach and solve common technical interview questions.
Given n non-negative integers, find two lines that form a container that can hold the most amount of water.
Given an unsorted array of integers and an integer k, find the number of subarrays whose sum equals k.
Given an array of integers, return an array of triplets such that i != j != k and nums[i] + nums[j] + nums[k] = 0.
Given two strings, return the longest common subsequence between the two strings.
Given an array of integers, return the indices of the two numbers that add up to a given target.
Given a two-dimensional binary matrix where 1 represents water and 0 represents land, mutate the matrix in place and return the matrix with the highest peak maximized.
Design and implement an efficient sampler that works in average O(1) time complexity.
Given an unsorted array of unique integers (size n + 1) and a first array identical to the second array but missing one integer (size n), find and output the missing integer.
Given the root of a complete binary tree, return the number of nodes in the tree.
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.
Interview prep and job hunting are chaos and pain. We can help. Really.