Sorting Interview Questions

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

Sorting Mock Interviews

Watch others solve Sorting 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?
Thumbs down
Technical Skills:
2/4
Problem Solving Ability:
2/4
Communication Ability:
3/4
Google Interview in JavaScriptMeeting hour optimization
Advance this person to the next round?
Thumbs down
Technical Skills:
2/4
Problem Solving Ability:
1/4
Communication Ability:
2/4
Airbnb Interview in C++Missing item list difference
Advance this person to the next round?
Thumbs up
Technical Skills:
4/4
Problem Solving Ability:
4/4
Communication Ability:
3/4
Google Interview in JavaOrder statistic of an unsorted array
Advance this person to the next round?
Thumbs up
Technical Skills:
4/4
Problem Solving Ability:
3/4
Communication Ability:
4/4
Google Interview in PythonAlien dictionary
Advance this person to the next round?
Thumbs up
Technical Skills:
4/4
Problem Solving Ability:
1/4
Communication Ability:
4/4
Microsoft Interview in PythonVertex distance order statistic
Advance this person to the next round?
Thumbs up
Technical Skills:
4/4
Problem Solving Ability:
4/4
Communication Ability:
4/4
Microsoft Interview in C#List partition (quicksort)
Advance this person to the next round?
Thumbs down
Technical Skills:
3/4
Problem Solving Ability:
2/4
Communication Ability:
3/4
Microsoft Interview in JavaK closest points
Advance this person to the next round?
Thumbs down
Technical Skills:
3/4
Problem Solving Ability:
2/4
Communication Ability:
3/4

Sorting Interview questions and solutions

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

HARD
Data Structures and Algorithms
Alien Dictionary

You are given a list of lexicographically sorted words from an alien language. This language has a unique order. Return the alphabetical order of all the letters found in the list of words.

Watch 3 interviews
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.

Watch 1 interview
MEDIUM
Data Structures and Algorithms
Kth Smallest Element

Given an integer array and an integer k, return the kth smallest element in the array.

Watch 2 interviews
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.

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.

Watch 1 interview
EASY
Data Structures and Algorithms
Reverse Words in a String

Given an input string `s`, reverse the order of the words without reversing the words themselves.

Watch 1 interview
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.

MEDIUM
Data Structures and Algorithms
Partition to K Equal Sum Subsets

Given an integer array nums and an integer k, return true if it is possible to divide this array into k non-empty subsets whose sums are all equal.

Watch 1 interview
MEDIUM
Data Structures and Algorithms
Partition List

Given a list of integers L and a number K, write a function that reorganizes L into three partitions: elements less than K, elements equal to K, and elements greater than K. No additional lists may be used.

Watch 1 interview
MEDIUM
Data Structures and Algorithms
Number of Islands

Given a 2D matrix, where "1" represents land and "0" represents water, count how many islands are present.

Watch 1 interview

We know exactly what to do and say to get the company, title, and salary you want.

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