Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
Small typo - 3:42 - Binary of 4 is (100) I am travelling this week guys. Hence the delay in upload.Hope you guys will understand.Thank you ❤❤
Bhaiya hamesha kahan travell karte rahte ho 😂😂
Today was easy. Support++ Making videos during travelling. Hats off.
finally the delay is over ........great as always
Thank you 🙏Apologies for the delay, as I am travelling this week
@@codestorywithMIKsir what kind of job you did ?? Why you are travelling
please upload daily, you method thinking about the solution and how to optimize it, Is very simple, understandable and attentive.
Today seemed easy one and I solved it in one go. thanks to you
Full support to ur channel sir😎
Congratulations for 44k subscribers 😊❤
Good one, easy solution
Congratulations for 44k subscribers 🤝🏻🎉
thanks....I used this logic instead to count.... int count=0; while(diff!=0){ if(diff%2!=0){ count++; } diff/=2; }
Should be easy. Congratulations on 44k 🎉
sir please make video on minimum number of operations to make string sorted
Thanks a lot bhaiya ❤❤ Congrats for 44k subs 🥳🥳
I have made this questin using bitset: class Solution {public: int minOperations(vector& nums, int k) { int xor_of_arr = 0; for(int &num : nums){ xor_of_arr ^= num; } bitset b1(xor_of_arr); bitset b2(k); std::bitset diff = b1 ^ b2; int diffCount = diff.count(); return diffCount; }};
Thanks ❤❤❤
3:42 100❤❤❤
Thanks a lot ❤️❤️🙏🙏. Added correction in pinned comment
Gjb yaar
Bro Bit Manipulation per playlist bna do pls.
Bhai please make biweekly(129)3 problem
bro can you do a series on segment trees?
❤❤
Did you also heard but 🍑 manipulation
Small typo - 3:42 - Binary of 4 is (100)
I am travelling this week guys. Hence the delay in upload.
Hope you guys will understand.
Thank you ❤❤
Bhaiya hamesha kahan travell karte rahte ho 😂😂
Today was easy.
Support++
Making videos during travelling. Hats off.
finally the delay is over ........great as always
Thank you 🙏
Apologies for the delay, as I am travelling this week
@@codestorywithMIKsir what kind of job you did ?? Why you are travelling
please upload daily, you method thinking about the solution and how to optimize it, Is very simple, understandable and attentive.
Today seemed easy one and I solved it in one go. thanks to you
Full support to ur channel sir😎
Congratulations for 44k subscribers 😊❤
Good one, easy solution
Congratulations for 44k subscribers 🤝🏻🎉
thanks....
I used this logic instead to count....
int count=0;
while(diff!=0){
if(diff%2!=0){
count++;
}
diff/=2;
}
Should be easy.
Congratulations on 44k 🎉
sir please make video on minimum number of operations to make string sorted
Thanks a lot bhaiya ❤❤ Congrats for 44k subs 🥳🥳
I have made this questin using bitset:
class Solution {
public:
int minOperations(vector& nums, int k) {
int xor_of_arr = 0;
for(int &num : nums){
xor_of_arr ^= num;
}
bitset b1(xor_of_arr);
bitset b2(k);
std::bitset diff = b1 ^ b2;
int diffCount = diff.count();
return diffCount;
}
};
Thanks ❤❤❤
3:42 100❤❤❤
Thanks a lot ❤️❤️🙏🙏. Added correction in pinned comment
Gjb yaar
Bro Bit Manipulation per playlist bna do pls.
Bhai please make biweekly(129)3 problem
bro can you do a series on segment trees?
❤❤
Did you also heard but 🍑 manipulation
❤❤