Description https://leetcode.com/problems/maximum-distance-in-arrays/ Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers from two…

Description https://leetcode.com/problems/next-permutation/ Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not…

Description https://leetcode.com/problems/minimum-cost-to-hire-k-workers/ There are N workers.  The i-th worker has a quality[i] and a minimum wage expectation wage[i]. Now we want to hire exactly K workers to form…

Description https://leetcode.com/problems/compare-version-numbers/ Given two version numbers, version1 and version2, compare them. Version numbers consist of one or more revisions joined by a dot ‘.’. Each revision consists…

Description https://leetcode.com/problems/missing-ranges/ We have a list of points on the plane.  Find the K closest points to the origin (0, 0). (Here, the distance between…

Description https://leetcode.com/problems/missing-ranges/ Given a sorted integer array nums, where the range of elements are in the inclusive range [lower, upper], return its missing ranges.…

Description https://leetcode.com/problems/majority-element/ Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊…

Description https://leetcode.com/problems/sort-colors/ Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are…

Description https://leetcode.com/problems/permutations/ Given a collection of distinct integers, return all possible permutations. Example: Input: [1,2,3] Output: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2],…

Description https://leetcode.com/problems/top-k-frequent-elements/ Given a non-empty array of integers, return the k most frequent elements. Example 1: Input: nums = [1,1,1,2,2,3], k =…