I solved this problem easily on my own the first way, but I was curious what kind of explanation you had with a 16 min video since I didn't think this problem warranted that amount of time. Glad I clicked cause that second solution is amazing. Even when I can solve these on my own, I get value from these videos. Thanks.
@chugisan68479 ай бұрын
To get the last 8 bits (at line 14), you can also AND the number with 255. (AND operation is more efficient than mod).
@theruler10969 ай бұрын
If someone still has any confusion why we are using %256, Lets forget binary, think about a decimal number 23456. What if we want to get the last digit? we use %10. What if 2 digit? We just use %100 (10*10=10^2) , incase of 3 digits %1000 (10*10*10= 10^3) and so on. We get a pattern here. It's like %base^num_of_digits. In this problem we want to get the number that is represented by the last 8 bit. Now, just think in the decimal number way, if we want to get the last 8 digit what should we do? mod by 10^8 (following the pattern). Incase of binary , base =2 and number of digits we want =8. So according to the pattern we have to do %2^8 which is equal to %256. So that's it what we are doing. (Hope it's not making the thing more complicated.) It can be also done by &255 .
@Pegasus02Kr9 ай бұрын
amazing. never thought that 255 constraint can be used to such solution
@MP-ny3ep9 ай бұрын
Great explanation as always. Thank you for the daily problems.
@madvier_83369 ай бұрын
reminds me of that one keras function
@EzWorkzzStudios6 ай бұрын
Amazing naive explanation, helped understanding the rest of the video!
@syeedtalha15509 ай бұрын
What a lucid explanation! Keep this up!
@servantofthelord81472 ай бұрын
the optimal solution was pretty cool! Bit manipulation questions are so satisfying to solve!
@robin_c244 ай бұрын
i'm amaze how you can come up with the optimal solution.
@EzWorkzzStudios6 ай бұрын
Second solution was sooo intuitive man...
@nicoluvas84869 ай бұрын
came in by O(1)
@shreehari25899 ай бұрын
Definitely medium problem and there is no way I would come up with the second solution.
@jayberry65579 ай бұрын
Why the memory is same before and after optimization on leetcode? I know in theory it should be less but I wonder why it works differently
@saulgoodman67109 ай бұрын
At first I thought this problem is nothing just straight forward, but the solution from you made it think how beautiful the solution is and how fundamental we should think, Love your explanation man! keep making these awesome videos of amazing questions.
@GCKteamKrispy9 ай бұрын
We learnt it in Digital signal processing. Couldn't understand the programming side of it. Thanks
@a_maxed_out_handle_of_30_chars9 ай бұрын
this was a good solution, I solved it using the first approach and liked your second approach :)
@harishdaga14399 ай бұрын
never imagine the second solution, thanks-------
@CS_n00b9 ай бұрын
I don't get why we need to XOR and can't just add?
@khanumar69389 ай бұрын
i believe thats another way of adding
@ngneerin9 ай бұрын
could have done with prefix sum too
@jamesabasifreke9 ай бұрын
For the second approach, instead of mod 256 would using logical & 000000011111111 work? To remove everything besides last 8?
@NeetCodeIO9 ай бұрын
Yeah I think so
@il50839 ай бұрын
Do we need to come up with the inplace solution in an interview?
@jayberry65579 ай бұрын
Thank you for dailies!
@ИгорьКабаков-з4м9 ай бұрын
we actually can use + instead of ^
@yousrimeftah57689 ай бұрын
omg!!!! i love it thank you
@xaviernogueira9 ай бұрын
Nice! More image algos plz
@krzysztofsobocinski22079 ай бұрын
I just wondering if you could use sums to avoid internal iteration for each element to make the algorithm a bit faster (roughly 9 times faster)
@a_maxed_out_handle_of_30_chars9 ай бұрын
we don't have to sum the entire row and sums internally iterates using for loop as well