# LeetCode 75. Sort Colors

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…

# LeetCode 46. Permutations

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],…

# LeetCode 347. Top K Frequent Elements

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

# LeetCode 215. Kth Largest Element in an Array

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…

# LeetCode 334. Increasing Triplet Subsequence

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

# LeetCode 73. Set Matrix Zeroes

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…

# LeetCode 560. Subarray Sum Equals K

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

# LeetCode 238. Product of Array Except Self

Description https://leetcode.com/problems/product-of-array-except-self/ Given an array nums of n integers where n > 1,  return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].…

# LeetCode 525. Contiguous Array

Description https://leetcode.com/problems/contiguous-array/ Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and…

# LeetCode 1046. Last Stone Weight

Description https://leetcode.com/problems/last-stone-weight/ We have a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and…