Master Data Structures & Algorithms for FREE at AlgoMap.io/
@johnhyde90484 ай бұрын
Dude!! Your explanation is awesome please continue to do the same 😄
@MoTosifAnsari-y9eАй бұрын
Thank you for the playlist bro it's really helpful 🙌
@thiagoribs295Ай бұрын
Hardest part is to understand what to return. Does it want a int? a list? By seeing the Output in the descrpition it looks like it want both, but the function asks for a int.
@vadymchecherinda28584 ай бұрын
For me the most complicated part is how to come to this solution. I mean algorithm. For me its not obvious. This is the most hard part.
@GregHogg4 ай бұрын
Yeah for sure
@16gowtham.s28Ай бұрын
Your awesome let's continue
@mohammadrafi8954 ай бұрын
Awesome!
@Insigna23824 ай бұрын
why isnt n initialized to len(nums)-1?
@sriramedit6592 ай бұрын
why n initialized to len(nums)-1
@towersongАй бұрын
Time Limit Exceeded
@memelover894 ай бұрын
while val in nums: nums.remove(val) k=len(nums) return k What about this Solution?? 👆☝
@coblt12933 ай бұрын
the time taken is slightly higher and sometimes they might ask you to not to use inbuilt functions (like remove) to understand your knowledge over the data structures. ( your solution is completely right no doubt about it but sometimes the interviewer might ask you to do it without the inbuilt function and do the same problem to know your understanding over the concept. )