Sorting

LeetCode problem #1300

Master fundamental sorting and searching algorithms and their applications.

Given an array of distinct integers and a target, return all unique combinations where the chosen numbers sum to target (elements may be reused)

Find the k largest elements from an unsorted array

Find the k smallest elements from an unsorted array

Find the missing number in an array containing n distinct numbers taken from 1, 2, 3, ..., n+1

Given an array of strings, group the anagrams together.

Group strings that are anagrams of each other together.

Find the intersection of two arrays and return the result as an array.

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Find the kth largest element in an unsorted array

Find the length of the longest consecutive elements sequence in an unsorted array.

Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.

Merge k sorted arrays into one sorted array using heap

LeetCode 88 merge sorted array in-place: reverse two pointers (merge from end) in O(m+n) time, O(1) space. Step-by-step + examples.

Given arrival and departure times of trains at a station, find the minimum number of platforms required so that no train is kept waiting

Find the minimum number of swaps required to sort an array.

Sort a linked list in O(n log n) time using constant extra space

Find the minimum number of intervals the CPU will take to finish all given tasks with a cooldown period between identical tasks

Find all unique triplets in the array which gives the sum of zero

Given two strings, determine if one is an anagram of the other.

Determine if two strings are anagrams of each other

Traverse a binary tree vertically and return nodes by columns