Browse search technical interview questions and explore the world's largest library of mock video interview recordings.

Watch others solve Search interview questions, see how they did, and learn from their mistakes.

Google Interview in JavaThird order statistic of a set

Advance this person to the next round?

Technical Skills:

2/4

Problem Solving Ability:

2/4

Communication Ability:

3/4

Google Interview in JavaOrder statistic of an unsorted array

Advance this person to the next round?

Technical Skills:

4/4

Problem Solving Ability:

3/4

Communication Ability:

4/4

LinkedIn Interview in PythonMatching pairs

Advance this person to the next round?

Technical Skills:

Problem Solving Ability:

Communication Ability:

Google Interview in C++Closest coin

Advance this person to the next round?

Technical Skills:

3/4

Problem Solving Ability:

4/4

Communication Ability:

4/4

Google Interview in PythonAlien dictionary

Advance this person to the next round?

Technical Skills:

4/4

Problem Solving Ability:

1/4

Communication Ability:

4/4

Microsoft Interview in PythonLongest consecutive sequence

Advance this person to the next round?

Technical Skills:

3/4

Problem Solving Ability:

3/4

Communication Ability:

2/4

Google Interview in JavaMost frequent integer and pairs of integers sum

Advance this person to the next round?

Technical Skills:

4/4

Problem Solving Ability:

4/4

Communication Ability:

4/4

Get step-by-step instructions on how to approach and solve common technical interview questions.

MEDIUM

Data Structures and Algorithms

Container With Most Water

Given n non-negative integers, find two lines that form a container that can hold the most amount of water.

GRAPH THEORYARRAYSSEARCHSORTING

Watch 1 interview

MEDIUM

Data Structures and Algorithms

Subarray Sum Equals K

Given an unsorted array of integers and an integer k, find the number of subarrays whose sum equals k.

ARRAYSSORTINGHASH TABLESSEARCH

Watch 2 interviews

MEDIUM

Data Structures and Algorithms

Three Sum

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

ARRAYSSORTINGHASH MAPSSEARCH

Watch 1 interview

MEDIUM

Data Structures and Algorithms

Longest Common Subsequence

Given two strings, return the longest common subsequence between the two strings.

STRINGSDYNAMIC PROGRAMMING

Watch 1 interview

EASY

Data Structures and Algorithms

Two Sum

Given an array of integers, return the indices of the two numbers that add up to a given target.

ARRAYSSEARCHHASH TABLES

Watch 5 interviews

MEDIUM

Data Structures and Algorithms

Find Peak Element

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.

ARRAYSSORTINGMAPSSEARCH

MEDIUM

Data Structures and Algorithms

Insert Delete getRandom O(1)

Design and implement an efficient sampler that works in average O(1) time complexity.

ARRAYSHASH MAPSSEARCH

MEDIUM

Data Structures and Algorithms

Find Missing Number In Array (Two Arrays)

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.

ARRAYSSEARCHMAPS

Watch 1 interview

MEDIUM

Data Structures and Algorithms

Count Complete Tree Nodes

Given the root of a complete binary tree, return the number of nodes in the tree.

TREESBINARY TREESSEARCHDEPTH FIRST SEARCH (DFS)

Watch 1 interview

MEDIUM

Data Structures and Algorithms

Right View Of Binary 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.

GRAPH THEORYSEARCHBINARY TREESTREES

Watch 1 interview

Interview prep and job hunting are chaos and pain. We can help. Really.