search

utkarsh006 / LeetCode-Grind

This Repo is a one way solution to ace your Technical Interviews and crack your dream Job by upsolving LeetCode standard problems.
MIT License
50 stars 26 forks source link

Oct 23_Leetcode daily challenge #289

Closed Anjali-Chaudhary3 closed 2 years ago

Anjali-Chaudhary3 commented 2 years ago

Description

You have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers in s got duplicated to another number in the set, which results in repetition of one number and loss of another number.

You are given an integer array nums 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.

Example 1:

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

Code of Conduct

Anjali-Chaudhary3 commented 2 years ago

@utkarsh006 please assign this issue to me

ankitkumar0622 commented 2 years ago

Hi , can you please assign me this task .

vanshikaa-agarwal commented 2 years ago

I would like to work on this

Vedant070401 commented 2 years ago

please assign this to me