Remove Duplicates from Sorted Array | Leetcode 26 | Top 150 interview question series

Top 150 interview question series
Remove Duplicates from Sorted Array
Leetcode problem number 26
JAVA interview programming playlist:
• Interview Programming ...
Git Repo:
github.com/Technosagelearning...

[@user-jj9rk4en9i]

great explanation simple approach for those in new in dsa

[@saarza9991]

1) HashSet could be used 2) the condition for upper bound of i in if block was unnecessary. You could've said: i

[@narendrabudaniya4353]

mam your code is left the last element always so return count is always less one here is the write code int pointer = 0; for (int i=0; i

[@RajYadav-yh7vv]

why to use (nums.length-1) in if condition. its working without this also. Submitted in leetcode and accepted successfully working code: var removeDuplicates = function (nums) { let count = 0; for (let i = 0; i < nums.length; i++) { if (nums[i] === nums[i + 1]) { continue; } else { nums[count] = nums[i]; count++; } } return count; };

[@ajeettiwari8622]

mam pls continue this interview series thanks you mam🤩🤩🤩🤩

[@SurajKumar-mq9ww]

nice explanation dude☺

[@eshasingh2847]

Well presented

[@pranjalipatil532]

Thank you mam

[@ronaldo76544]

Excellent

[@subhashreesahoo5760]

Hi , Could you please help me in understanding this question , because I have done this problem in other way , I am getting the desired result in IDE but in leetcode it is failing . Please have a look on below approach: Set set=Arrays.stream(nums).boxed().collect(Collectors.toCollection(LinkedHashSet::new)); int[] expectedNums=new int[set.size()]; int index=0; for(int i:set){ expectedNums[index]=i; index++; } System.out.println(Arrays.toString(expectedNums)); System.out.println(expectedNums.length); I can return expectedNums.length at the end . But this solution is not accepted , why ?

[@thevichusvlog5809]

hey subha , I also went for the same approach and faced same issue. Just read the test case how they're validating our code. They're not only validating our final distinct array size they are also validating whether final values in nums[] arrays is distinct or not. public int removeDuplicates(int[] nums) { int i=0; List distinctNums = Arrays.stream(nums).distinct() .boxed().collect(Collectors.toList()); for(int num:distinctNums){ nums[i] = num; i++; } return distinctNums.size(); } before returning the distinct array size please do assign the distinct value to same nums[] array back. Else test case validation will be failed in back-end.

[@kunaldixit2566]

thanks mam

[@imvishu09]

please explain this -> nums[count] = nums[i];

[@vamshisundupalle6141]

can u continue the series mam pls ur approach is so good

[@TechnosageLearning]

Sure..Will start uploading the videos soon

[@pratiknandurkar7925]

❤❤

[@user-lk8zi8qh3k]

@6.42 Why the last element won't be the duplicate?

[@TechnosageLearning]

Because there is no element after the last element..If it's a duplicate then second last and last element would be same..If we have already checked for second last element..No need to check last element since it's a sorted array

[@ShivaKumar-vu5sg]

why are you writing i

[@prangyajena3082]

Tried but it’s breaking. The loop should run till nums.length where on the last element if it’s not meeting criteria count should increase

[@Sainathbabu840]

Watch 5:20

[@musamehdiyevv]

class Solution { public int removeDuplicates(int[] nums) { int k = 1; for (int i = 1; i < nums.length; i++) { if (nums[i] != nums[k-1]) { nums[k] = nums[i]; k++; } } return k; } }

[@navinvenkat3404]

Mam can you give me the solution in C language pls!

[@Jack-ss4re]

Almost same thing, you can ask chatgpt to convert it to C tho

[@dipeshraj4914]

Mam,can u provide these 150 questions list...

[@amanraj5116]

It is already listed on Leetcode websites as 150 interview questions

[@ne_aqqumka]

и чё