LeetCode 219.Contains Duplicate II
Description:
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.
LeetCode 136.Single Number
LeetCode 136.Single Number
Description:
Given an array of integers, every element appears twice except for one. Find that single one.
LeetCode 268.Missing Number
LeetCode 268.Missing Number
Description:
Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.
LeetCode 27.Remove Element
LeetCode 27.Remove Element
Description:
Given an array and a value, remove all instances of that value in-place and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.
LeetCode 283.Move Zeroes
LeetCode 283.Move Zeroes
Description:
Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.
For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].
Note:
- You must do this in-place without making a copy of the array.
- Minimize the total number of operations.
LeetCode 442.Find All Duplicates in an Array
LeetCode 442.Find All Duplicates in an Array
Description:
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements that appear twice in this array.
Could you do it without extra space and in O(n) runtime?
LeetCode 448.Find All Numbers Disappeared in an Array
LeetCode 448.Find All Numbers Disappeared in an Array
Description:
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements of [1, n] inclusive that do not appear in this array.
Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
LeetCode 561.Array Partition I
LeetCode 561.Array Partition I
Description:
Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.
LeetCode 566.Reshape the Matrix
LeetCode 566.Reshape the Matrix
Description:
In MATLAB, there is a very useful function called ‘reshape’, which can reshape a matrix into a new one with different size but keep its original data.
You’re given a matrix represented by a two-dimensional array, and two positive integers r and c representing the row number and column number of the wanted reshaped matrix, respectively.
The reshaped matrix need to be filled with all the elements of the original matrix in the same row-traversing order as they were.
LeetCode 628. Maximum Product of Three Numbers
LeetCode 628. Maximum Product of Three Numbers
Description:
Given an integer array, find three numbers whose product is maximum and output the maximum product.