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/ You are given an inclusive range [lower, upper] and a sorted unique integer array nums, where all elements are in the inclusive range.…

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/permutations/ Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. Example 1:…

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 =…

Description https://leetcode.com/problems/kth-largest-element-in-an-array/ Find the kth largest element in an unsorted array. Note that it is the kth largest element in the…

Description https://leetcode.com/problems/increasing-triplet-subsequence/ Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.…

Description https://leetcode.com/problems/set-matrix-zeroes/ Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place. Example…

Description https://leetcode.com/problems/subarray-sum-equals-k/ Given an array of integers nums and an integer k, return the total number of continuous subarrays whose sum equals to k. Example…

Description https://leetcode.com/problems/product-of-array-except-self/ Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product…