448. Find All Numbers Disappeared in an Array

Easy

8.2K

428

Given an array `nums`

of `n`

integers where `nums[i]`

is in the range `[1, n]`

, return *an array of all the integers in the range* `[1, n]`

*that do not appear in* `nums`

.

**Example 1:**

Input:nums = [4,3,2,7,8,2,3,1]Output:[5,6]

**Example 2:**

Input:nums = [1,1]Output:[2]

**Constraints:**

`n == nums.length`

`1 <= n <= 10`

^{5}`1 <= nums[i] <= n`

**Follow up:** Could you do it without extra space and in `O(n)`

runtime? You may assume the returned list does not count as extra space.

Accepted

711.4K

Submissions

1.2M

Acceptance Rate

59.9%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved