442. Find All Duplicates in an Array
Given an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears at most twice, return an array of all the integers that appears twice.
You must write an algorithm that runs in O(n) time and uses only constant auxiliary space, excluding the space needed to store the output
Example 1:
Input: nums = [4,3,2,7,8,2,3,1] Output: [2,3]
Example 2:
Input: nums = [1,1,2] Output: [1]
Example 3:
Input: nums = [1] Output: []
Constraints:
n == nums.length1 <= n <= 1051 <= nums[i] <= n- Each element in
numsappears once or twice.
Asked at 11 companies
Google
TCSTopics
Loading editor…
1class Solution:
2 def findDuplicates(self, nums: List[int]) -> List[int]:
3
Starter codePython 3Spaces: 4
Loading editor…
1class Solution:
2 def findDuplicates(self, nums: List[int]) -> List[int]:
3
Starter codePython 3Spaces: 4
Examples
Input
[4,3,2,7,8,2,3,1]
Input
[1,1,2]
Input
[1]
Your code is saved on this device.Solution