Find the disappearing numbers (LeetCode 448) | Full solution with examples | Study Algorithms

[@arnavkukreti2009]

I've seen your videos many times and you're way of explanation is great...!!! thank you

[@mindmatters851]

your explanation is too good every one can understand . thanks bro

[@CostaKazistov]

That's pretty clever. Really interesting solution.👍

[@sravansunkara]

I always learn something new from you, thanks alot! btw I used the approach I learned from you "Counting Sort".

[@pranav8609]

you are underated

[@manishjeena6325]

Wow, Amazing Explanation 🥰🙏Thank You❤

[@RavinderSingh-nh6th]

Thank you so much

[@shubhambelwal674]

you have made this approach ?? by the way ,i liked this approach

[@priyankarai7917]

great explanation👍👍

[@l1z1ng3r]

thank for the video) 💘

[@mdanik1361]

I couldn’t understand the brute force method and efficient method time complexity difference... In brute force meth, iterating through every elements doesn’t take O(n) too? :)

[@nikoo2805]

In Brute Force method you are iterating over the array again and again to find the element. So you are doing n iterations for n items. Hence, a time complexity of O(n^2) In the efficient method, you only iterate once Hope that helps :)

[@mdanik1361]

@@nikoo2805 thank u...can u share the brute force code please?

[@nikhilbatchu7910]

Tried this using the count sort. I have created a temp array and stored the frequencies.Is my approach can be considered as optimal?

[@nikoo2805]

Yep…this solution will also be optimal

[@TraderOff-Road]

thaaanks

[@vigneshr4197]

No need to create new array while multiplying with -1?

[@ashrafel-gaaly8657]

I think you do if some elements in the array are negative. In these examples they are all positive and yes you can update the existing array

[@subee128]

Thanks

[@nerd6134]

Fire 🔥 bro

[@Himanshu_85-e2i]

Good bhaiya

[@RohanSingh-my3nl]

Making Video is So long for no reason Thuuuuuuuuuuuuuuuuuuuuuuuuuuuuu

[@nikoo28]

Everyone has a different learning pace my friend. For quick learners there are always timestamps and chapters you can skip to :)