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…
Category: Array
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…
LeetCode 268. Missing Number
Description https://leetcode.com/problems/missing-number/ Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from…
LeetCode 136. Single Number
Description https://leetcode.com/problems/single-number/ Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have…
LeetCode 36. Valid Sudoku
Description https://leetcode.com/problems/valid-sudoku/ Determine if a 9×9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: Each…
LeetCode 48. Rotate Image
Description https://leetcode.com/problems/rotate-image/ You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: You have…
LeetCode 283. Move Zeroes
Description https://leetcode.com/problems/move-zeroes/ Given an integer array nums, move all 0‘s to the end of it while maintaining the relative order of the…
LeetCode 350. Intersection of Two Arrays II
Description https://leetcode.com/problems/intersection-of-two-arrays-ii/ Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many…
LeetCode 189. Rotate Array
Description https://leetcode.com/problems/rotate-array/ Given an array, rotate the array to the right by k steps, where k is non-negative. Example 1: Input: [1,2,3,4,5,6,7] and k…
LeetCode 217. Contains Duplicate
Description https://leetcode.com/problems/contains-duplicate/ Given an array of integers, find if the array contains any duplicates. Your function should return true if…