No video

Single Number III - Leetcode 260 - Python

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

NeetCodeIO

NeetCodeIO

Күн бұрын

Пікірлер: 50
@AnordinaryMan007
@AnordinaryMan007 3 ай бұрын
I don't like bit manipulation at all
@viveksoni3269
@viveksoni3269 3 ай бұрын
Bit manipulation is awful!
@reactionchamber
@reactionchamber 3 ай бұрын
same here
@brij4887
@brij4887 3 ай бұрын
Do you hate it more than dynamic programming? I can some what come close to a solution for bit manipulation problems but I can't understand dp solutions even after watching the explanation multiple times.
@AnordinaryMan007
@AnordinaryMan007 3 ай бұрын
@@brij4887 Na bro dp is much better than this.
@brij4887
@brij4887 3 ай бұрын
@@AnordinaryMan007 to be able to solve dp problems on my own do I need to solve enough problems in order to reach the moment where it all clicks? Do you have any suggestions?
@siddharth-gandhi
@siddharth-gandhi 3 ай бұрын
these are interesting questions, however bit manipulation questions just feel like one trick pony solutions (much like greedy). interesting but not satisfying sadly.
@NeetCodeIO
@NeetCodeIO 3 ай бұрын
I agree, I don't think I've ever been asked bit manipulation in an interview. Has anyone here been asked it?
@PanicAtProduction
@PanicAtProduction 3 ай бұрын
Do you think blind-75 and neetcode-75 are still solid??
@venkadeshb7973
@venkadeshb7973 3 ай бұрын
@@NeetCodeIO Not in interviews but in most of the OA's
@samarth_suthar_
@samarth_suthar_ 3 ай бұрын
@@NeetCodeIO i think that it is more relevant to embedded system role's interview(close to electronics role).
@ap2s2000
@ap2s2000 3 ай бұрын
@@NeetCodeIO I've had experience with Apple asking bit manip
@aashishbathe
@aashishbathe 3 ай бұрын
You flipped the 3 and 5 in a and b.. But the concept is clear.. Thanks neetcode!
@NeetCodeIO
@NeetCodeIO 3 ай бұрын
Good catch, yeah thats my mistake. It would technically still work tho, so hopefully its not too confusing
@aashishbathe
@aashishbathe 3 ай бұрын
@@NeetCodeIO yess it still works. Awesome solution man. I can never think of such a solution ever 😂
@LotsOfFunyoutubechannel
@LotsOfFunyoutubechannel 3 ай бұрын
Had to rewind back multiple times but the grouping still didn't make sense. This comment cleared my doubt. Should have been the top comment😅
@csam11100
@csam11100 3 ай бұрын
The a-ha moment is the grouping concept. Feel depressed even practicing more than a thousand of LC, still can not get it in an hour and open YT to watch your solution like I did 4 years ago. (BTW, we can use xor & -xor to find the right most set bit of xor) Appreciate your explanation as usual.
@mahesh_bvn
@mahesh_bvn 3 ай бұрын
Hey Navdeep, first of all a huge thank you for making videos and helping us throughout the journey of DSA. I would like to request you to make LC bi weekly and weekly contest solutions as well. The questions in contests contain different gravy and it'll help us be more prepared for interviews... Cheers🎉
@yashwanthgajji4036
@yashwanthgajji4036 3 ай бұрын
This is really a tricky one. Your explanation is so much better. Thank you so much. Finally, I got 'May' badge in leetcode.🎉
@jayhee1557
@jayhee1557 2 ай бұрын
This is the best explanation I was able to find. Thanks NeetCode.
@nipunshah1373
@nipunshah1373 3 ай бұрын
splendid logic (in depth know how of Bitwise Operations)
@mrreese2342
@mrreese2342 3 ай бұрын
The concept is understandable but to come up with the solution is almost impossible, thank you for the explanation it's the clearest one on youtube.
@MP-ny3ep
@MP-ny3ep 3 ай бұрын
Tricky problem but your solution made it look very easy. Thank you
@visintel
@visintel 3 ай бұрын
Not gonna lie I don’t think I can come up with this solution in an interview
@ovokteb9671
@ovokteb9671 3 ай бұрын
So much crystal clear explanation . Really in love with you ❤
@user-wi3cy8hq3v
@user-wi3cy8hq3v 3 ай бұрын
Your explanation is amazing. Thanks!
@guy_cod
@guy_cod 3 ай бұрын
Thank you very much neetcode ❤
@princeanthony8525
@princeanthony8525 8 күн бұрын
Fooking beautiful.
@LOKESHE-wi2yd
@LOKESHE-wi2yd 3 ай бұрын
bro we need 137 single number ii two bucket approach in your way of explanation please , i can't found your video for that problem
@evalyly9313
@evalyly9313 3 ай бұрын
I like your solution, even it makes me feel bad of myself because I will never come up with this myself 😢
@protodimbo
@protodimbo 3 ай бұрын
I would never have thought to use bit manipulation here
@adithyapaib
@adithyapaib 3 ай бұрын
class Solution: def singleNumber(self, nums: List[int]) -> List[int]: xor,a,b = 0,0,0 for i in nums: xor^=i diff = xor & -xor for i in nums: if diff & i: a^=i continue b^=i return [a,b] A better solluiions
@fraserdab
@fraserdab 3 ай бұрын
Great explanation
@jhanavikumari274
@jhanavikumari274 3 ай бұрын
wow i was looking for it
@shazam3218x
@shazam3218x 3 ай бұрын
I have a Microsoft technical interview for a software engineer on 12th and 13th june. I started leetcode last week, any tips to clear the interview, since i would only have like 2 weeks of leetcode practice.
@yaxprajapati115
@yaxprajapati115 2 ай бұрын
just tell me from where have you learnt to build intuition?
@AMX0013
@AMX0013 3 ай бұрын
I hope no one ever asks bot manipulation in an interview, and the only one who ever has to use it, be the compiler🙏
@chien-yuyeh9386
@chien-yuyeh9386 3 ай бұрын
Nice!
@dhaanaanjaay
@dhaanaanjaay 3 ай бұрын
Bit Manipulation questions are haunting DCC!!!
@gulshirulislam6936
@gulshirulislam6936 3 ай бұрын
I feel Navdeep = Srinivasa Ramanujan junior
@rishikkumarb7684
@rishikkumarb7684 3 ай бұрын
leetcode 2035 ,if possible can u able to make a video for this problem ?
@rahulsihara8946
@rahulsihara8946 3 ай бұрын
That's quick mate 😂
@BrendanBennett-jj2rn
@BrendanBennett-jj2rn 3 ай бұрын
what drawing software do you use?
@qj3690
@qj3690 3 ай бұрын
can you solve path sum 3 please
How I would learn Leetcode if I could start over
18:03
NeetCodeIO
Рет қаралды 486 М.
Subarray Sums Divisible by K - Leetcode 974 - Python
16:41
NeetCodeIO
Рет қаралды 14 М.
Фейковый воришка 😂
00:51
КАРЕНА МАКАРЕНА
Рет қаралды 5 МЛН
When you discover a family secret
00:59
im_siowei
Рет қаралды 32 МЛН
Fast Inverse Square Root - A Quake III Algorithm
20:08
Nemean
Рет қаралды 5 МЛН
This Algorithm is 1,606,240% FASTER
13:31
ThePrimeagen
Рет қаралды 811 М.
Leetcode 46. Permutations : Introduction to backtracking
10:06
ComputerBread
Рет қаралды 94 М.
The Unfair Way I Got Good At LeetCode
23:02
Aman Manazir
Рет қаралды 78 М.
Why I focus on patterns instead of technologies
7:55
NeetCodeIO
Рет қаралды 222 М.
5 Useful F-String Tricks In Python
10:02
Indently
Рет қаралды 302 М.
Minimum Increment to Make Array Unique - Leetcode 945 - Python
16:20
Generics are VITAL in typed Python
16:54
Carberra
Рет қаралды 8 М.
You Are WRONG About 0 Based Indexing
25:02
ThePrimeTime
Рет қаралды 277 М.
Coin Change - Dynamic Programming Bottom Up - Leetcode 322
19:23