Remove Duplicates from Sorted Array 2 | Leetcode 80 | Top 150 Interview questions series

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

[@muhammadomersaleem4919]

Explanation is different from the code solution. If n == nums[i-2], 'i' doesn't increment in the code but in the explanation.

[@dineshvasireddy]

Great intuition and the approach was perfect comparing to the complex Leetcode editorial approaches.

[@mayukh_]

Essentially this not in constant space. Because in the for loop, you are creating another copy for the array.

[@user-bl1gg1ff1q]

class Solution { public int removeDuplicates(int[] nums) { int c=0; for(int i=0;i

[@oxanasf6369]

Wow, what a great explanation and a beautiful algorithm!

[@ShubhamKumar-yz2yz]

Amazing, very easy explanation, thank you

[@nazim4525]

I love your teaching style

[@JackCoderr]

best explaination and clear mam, thank you so much mam

[@bobosian]

Crazy. Good job there.

[@gurudassulebhavikar]

Hey Amrita can you please finish this playlist? Not sure why you stopped making videos on this 150 interview question series. But out of all the channels on youtube I found only this channel where I was able to understand the solutions easily. Please continue making more videos. 🙏 Thank you.

[@TechnosageLearning]

Hello, I am glad to know that the solutions presented here helped you. Due to some medical emergency we have reduced the pace, soon will start working on more solutions. please stay tuned. Thankyou for the understanding. 🙏

[@ChaudharySaab05]

Well Explained dear

[@avanishkumar1689]

good sol and well explained

[@vivekmalviya3036]

Thank u ❤❤❤

[@jason-rv5sp]

Great explanation. the key point is nums[i] != num[i-2]. But why in the code it becomes n != nums[i-2] ?

[@vinayvardhanyt2415]

In interviews they are going to ask in place modification of the array.

[@saurabhvishwakarma9193]

great

[@codingbitsnbytes]

Mam, it would be great if you give your linkedin profile in the description, and also tell your full name, it would help to make connection

[@KRRSPORTS]

if array is like that 1 2 3 4 4 4 5 5 6 in that what about 2 element

[@DeepakSingh-li1oe]

respect++

[@AyushTiwari-vv2xk]

mam why this solution not working class Solution { public int removeDuplicates(int[] nums) { int j=0; for(int i=0;i

[@vikeshkumarmahto16]

class Solution { public: int removeDuplicates(vector& nums) { int j=2; int k=nums.size(); if (k

[@vikeshkumarmahto16]

@@Sowmyakotha-lj8te see the code I will do it same

[@mohammedmusaib4489]

bro because we not exactly comparing i with previous i-2 element

[@surajsidar2294]

@@mohammedmusaib4489 for this test case [1,1,1,2,2,3] if you compare with i-2 it won't work. You have to compare with j-2