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

  Рет қаралды 10,831

Nikhil Lohia

Nikhil Lohia

Күн бұрын

Пікірлер: 28
@asavariambavane
@asavariambavane 7 күн бұрын
appreciate the way you explained this!
@mindmatters851
@mindmatters851 Жыл бұрын
your explanation is too good every one can understand . thanks bro
@arnavkukreti2009
@arnavkukreti2009 5 ай бұрын
I've seen your videos many times and you're way of explanation is great...!!! thank you
@CostaKazistov
@CostaKazistov 2 жыл бұрын
That's pretty clever. Really interesting solution.👍
@ruhi8018
@ruhi8018 Ай бұрын
so much thank you my dear bro the way you you teach us is very easy way to learn this coding thank you
@sravansunkara
@sravansunkara 4 ай бұрын
I always learn something new from you, thanks alot! btw I used the approach I learned from you "Counting Sort".
@manishjeena6325
@manishjeena6325 Жыл бұрын
Wow, Amazing Explanation 🥰🙏Thank You❤
@pranav8609
@pranav8609 Жыл бұрын
you are underated
@priyankarai7917
@priyankarai7917 Жыл бұрын
great explanation👍👍
@l1z1ng3r
@l1z1ng3r Жыл бұрын
thank for the video) 💘
@RavinderSingh-nh6th
@RavinderSingh-nh6th Жыл бұрын
Thank you so much
@nikhilbatchu7910
@nikhilbatchu7910 2 жыл бұрын
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
@nikoo2805 2 жыл бұрын
Yep…this solution will also be optimal
@rahulshendre7089
@rahulshendre7089 2 ай бұрын
thanks man
@mdanik1361
@mdanik1361 2 жыл бұрын
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
@nikoo2805 2 жыл бұрын
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
@mdanik1361 2 жыл бұрын
@@nikoo2805 thank u...can u share the brute force code please?
@nerd6134
@nerd6134 2 жыл бұрын
Fire 🔥 bro
@shubhambelwal674
@shubhambelwal674 7 ай бұрын
you have made this approach ?? by the way ,i liked this approach
@vigneshr4197
@vigneshr4197 2 жыл бұрын
No need to create new array while multiplying with -1?
@Ashraf.elgaaly
@Ashraf.elgaaly Жыл бұрын
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
@TraderOff-Road
@TraderOff-Road 6 ай бұрын
thaaanks
@subee128
@subee128 Жыл бұрын
Thanks
@Himanshu_85-e2i
@Himanshu_85-e2i Жыл бұрын
Good bhaiya
@RohanSingh-my3nl
@RohanSingh-my3nl 8 ай бұрын
Making Video is So long for no reason Thuuuuuuuuuuuuuuuuuuuuuuuuuuuuu
@nikoo28
@nikoo28 8 ай бұрын
Everyone has a different learning pace my friend. For quick learners there are always timestamps and chapters you can skip to :)
小丑教训坏蛋 #小丑 #天使 #shorts
00:49
好人小丑
Рет қаралды 54 МЛН
How I Mastered Data Structures and Algorithms in 8 Weeks
15:46
Aman Manazir
Рет қаралды 147 М.
How I would learn Leetcode if I could start over
18:03
NeetCodeIO
Рет қаралды 758 М.
Making an Algorithm Faster
30:08
NeetCodeIO
Рет қаралды 189 М.
小丑教训坏蛋 #小丑 #天使 #shorts
00:49
好人小丑
Рет қаралды 54 МЛН