Eye opener for me. Just an observation - we don't even need to counteven. Because if the bit is zero in the answer then we need to do nothing in the loop as we have initialized the answer to zero to start with. But for the sake of explanation you had it - Really helps.
Eye opener for me. Just an observation - we don't even need to counteven. Because if the bit is zero in the answer then we need to do nothing in the loop as we have initialized the answer to zero to start with. But for the sake of explanation you had it - Really helps.
Thanks a lot for making these videos :) You explanations are simple and have really helped me improve my coding skills.
Your explanations are amazing, truly helped me out mam
nice but there is mistake in line 8 it should be A[j] instead of A[i].
This is o(n*m) time complexity but in the problem statement asked in linear complexity.
Your explanations are simple and best
Amazing explanation !
At 7:34 there is a mistake
thanks for the video.
What if there are negative numbers?
Amazing Explanation Alisha
Thanks for this good explanation
Nicely explained!
Splendid Explanation
zor??? what is this , has anyone else also heard x-or being pronouced as zor..
Nice explanation
Nice explanation ma'am!
does this approach work for -ve nos.?
amazing explanation
Time Complexity is O(32 * N) and its not linear time complexity. Otherwise the explanation was great!
it is linear bro
It is almost linear.
Great explanation.
This fails if we have negative numbers
Thanks a lottttt
Its not A[i] it is A[j]
Love uhh mam ❣️
Part 2 private krr rakhi h public krrdo
leetcode + interviewbit is enough to get into a good product based cmpy ? alisha
dono pe same ques h bhai sahab
@@gunahawk6893 kue mai kood jaa
@@AnkitSharma-jk2wx seridaw bunda
@@gunahawk6893 bhai kesi chalri phir coding
@@coderhumai 400 problems done