Skip to content
This repository has been archived by the owner on Oct 14, 2021. It is now read-only.

Remove Duplicates from Sorted Array [Java-Solution required] #471

Closed
aditya109 opened this issue Oct 3, 2021 · 6 comments · Fixed by #497 or #501
Closed

Remove Duplicates from Sorted Array [Java-Solution required] #471

aditya109 opened this issue Oct 3, 2021 · 6 comments · Fixed by #497 or #501
Assignees

Comments

@aditya109
Copy link
Owner

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.

Return k after placing the final result in the first k slots of nums.

Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.

Custom Judge:

The judge will test your solution with the following code:

int[] nums = [...]; // Input array
int[] expectedNums = [...]; // The expected answer with correct length

int k = removeDuplicates(nums); // Calls your implementation

assert k == expectedNums.length;
for (int i = 0; i < k; i++) {
    assert nums[i] == expectedNums[i];
}

If all assertions pass, then your solution will be accepted.

Example 1:

Input: nums = [1,1,2]
Output: 2, nums = [1,2,_]
Explanation: Your function should return k = 2, with the first two elements of nums being 1 and 2 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).

Example 2:

Input: nums = [0,0,1,1,1,2,2,3,3,4]
Output: 5, nums = [0,1,2,3,4,_,_,_,_,_]
Explanation: Your function should return k = 5, with the first five elements of nums being 0, 1, 2, 3, and 4 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).

Constraints:

  • 0 <= nums.length <= 3 * 104
  • -100 <= nums[i] <= 100
  • nums is sorted in non-decreasing order.
@NidhiMalpani
Copy link
Contributor

Hello. I would like to work on this issue. Could you please assign this to me?

@NidhiMalpani
Copy link
Contributor

Can a PR be accepted even if it isn't assigned to that particular person?

@saumyakr1232
Copy link
Contributor

i would like to solve this problem, please assign me

@pcpriyankapc
Copy link
Contributor

I know how to remove duplicates from sorted array in Java, Please assign me this issue.

@aditya109
Copy link
Owner Author

Can a PR be accepted even if it isn't assigned to that particular person?

Yes @NidhiMalpani ! You can raise a PR and it will still be counted as an open source contribution and Hacktoberfest entry.

@aditya109
Copy link
Owner Author

aditya109 commented Oct 5, 2021

Hi guys ! Love to see such a great response ! Please raise PR for this issue as per CONTRIBUTING.md. Will review and merge your PRs if it is correctly raised and written.

@aditya109 aditya109 linked a pull request Oct 6, 2021 that will close this issue
NidhiMalpani added a commit to NidhiMalpani/git-osp-for-beginners that referenced this issue Oct 6, 2021
@aditya109 aditya109 linked a pull request Oct 6, 2021 that will close this issue
aditya109 pushed a commit that referenced this issue Oct 6, 2021
aditya109 pushed a commit that referenced this issue Oct 10, 2021
* Remove Duplicates From Sorted Array

Created PR for Issue #471

* Java Code for merging sorted arrays

Created PR for issue #449
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.