Register for our webinar

1 hour

Step 1

Step 2

Congratulations!

You have registered for our webinar

Oops! Something went wrong while submitting the form.

Step 1

Step 2

Confirmed

You are scheduled with Interview Kickstart.

Redirecting...

Oops! Something went wrong while submitting the form.

Head of Career Skills Development & Coaching

*Based on past data of successful IK students

You have a set of positive integers, which originally contains all the numbers from `1`

to `n`

. Unfortunately, due to some error, one of the numbers in the set got duplicated to another number in the set, which results in repetition of one number and loss of another number.

Given an integer array `numbers`

representing the data status of this set after the error, find the number that occurs twice and the number that is missing and return them in the form of an array.

```
{
"numbers": [5, 4, 2, 3, 5]
}
```

Output:

```
[5, 1]
```

```
{
"nums": [1, 1]
}
```

Output:

```
[1, 2]
```

Return two integers in form of a list `[x, y]`

where `x`

represents the duplicated number and `y`

represents the missing number.

Constraints:

- 2 <= size of the input list <= 10
^{5} - 1 <= any element of the input list <= 10
^{5}

```
/*
Asymptotic complexity in terms of the number of elements in \`numbers\` \`n\`:
* Time: O(n).
* Auxiliary space: O(1).
* Total space: O(1).
*/
vector<int> find_error(vector<int> &numbers) {
vector<int> answer(2);
for (int i : numbers) {
if (numbers[abs(i) - 1] < 0) {
answer[0] = abs(i);
}
else {
numbers[abs(i) - 1] *= -1;
}
}
for (int i = 0; i < int(numbers.size()); i++) {
if (numbers[i] > 0) {
answer[1] = i + 1;
}
}
return answer;
}
```

We hope that these solutions to the set mismatched problem have helped you level up your coding skills. You can expect problems like these at top tech companies like Amazon and Google.

If you are preparing for a tech interview at FAANG or any other Tier-1 tech company, register for Interview Kickstart’s FREE webinar to understand the best way to prepare.

Interview Kickstart offers interview preparation courses taught by FAANG+ tech leads and seasoned hiring managers. Our programs include a comprehensive curriculum, unmatched teaching methods, and career coaching to help you nail your next tech interview.

We offer 18 interview preparation courses, each tailored to a specific engineering domain or role, including the most in-demand and highest-paying domains and roles, such as:

- Back-end Engineering Interview Course
- Front-end Engineering Interview Course
- Full Stack Developer Interview Course

To learn more, register for the FREE webinar.

Note: Input and Output will already be taken care of.

You have a set of positive integers, which originally contains all the numbers from `1`

to `n`

. Unfortunately, due to some error, one of the numbers in the set got duplicated to another number in the set, which results in repetition of one number and loss of another number.

Given an integer array `numbers`

representing the data status of this set after the error, find the number that occurs twice and the number that is missing and return them in the form of an array.

```
{
"numbers": [5, 4, 2, 3, 5]
}
```

Output:

```
[5, 1]
```

```
{
"nums": [1, 1]
}
```

Output:

```
[1, 2]
```

Return two integers in form of a list `[x, y]`

where `x`

represents the duplicated number and `y`

represents the missing number.

Constraints:

- 2 <= size of the input list <= 10
^{5} - 1 <= any element of the input list <= 10
^{5}

```
/*
Asymptotic complexity in terms of the number of elements in \`numbers\` \`n\`:
* Time: O(n).
* Auxiliary space: O(1).
* Total space: O(1).
*/
vector<int> find_error(vector<int> &numbers) {
vector<int> answer(2);
for (int i : numbers) {
if (numbers[abs(i) - 1] < 0) {
answer[0] = abs(i);
}
else {
numbers[abs(i) - 1] *= -1;
}
}
for (int i = 0; i < int(numbers.size()); i++) {
if (numbers[i] > 0) {
answer[1] = i + 1;
}
}
return answer;
}
```

We hope that these solutions to the set mismatched problem have helped you level up your coding skills. You can expect problems like these at top tech companies like Amazon and Google.

If you are preparing for a tech interview at FAANG or any other Tier-1 tech company, register for Interview Kickstart’s FREE webinar to understand the best way to prepare.

Interview Kickstart offers interview preparation courses taught by FAANG+ tech leads and seasoned hiring managers. Our programs include a comprehensive curriculum, unmatched teaching methods, and career coaching to help you nail your next tech interview.

We offer 18 interview preparation courses, each tailored to a specific engineering domain or role, including the most in-demand and highest-paying domains and roles, such as:

- Back-end Engineering Interview Course
- Front-end Engineering Interview Course
- Full Stack Developer Interview Course

To learn more, register for the FREE webinar.

**Attend our free webinar to amp up your career and get the salary you deserve.**

Hosted By

Ryan Valles

Founder, Interview Kickstart

- Designed by 500 FAANG+ experts
- Live training and mock interviews
- 17000+ tech professionals trained

00

Days

:

00

Hrs

:

00

Mins

:

00

Secs