Minimum Number of Operations to Make Array XOR Equal to K | Easy | Leetcode 2997 | codestorywithMIK

Поделиться
HTML-код
  • Опубликовано: 5 ноя 2024

Комментарии • 29

  • @codestorywithMIK
    @codestorywithMIK  6 месяцев назад +25

    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 ❤❤

    • @shashanksharma2258
      @shashanksharma2258 6 месяцев назад

      Bhaiya hamesha kahan travell karte rahte ho 😂😂

  • @DevOpskagyaan
    @DevOpskagyaan 6 месяцев назад +10

    Today was easy.
    Support++
    Making videos during travelling. Hats off.

  • @dipalisharma4682
    @dipalisharma4682 6 месяцев назад +12

    finally the delay is over ........great as always

    • @codestorywithMIK
      @codestorywithMIK  6 месяцев назад +4

      Thank you 🙏
      Apologies for the delay, as I am travelling this week

    • @32_ec_divagupta22
      @32_ec_divagupta22 6 месяцев назад

      ​@@codestorywithMIKsir what kind of job you did ?? Why you are travelling

  • @mriit3025
    @mriit3025 6 месяцев назад +2

    please upload daily, you method thinking about the solution and how to optimize it, Is very simple, understandable and attentive.

  • @gui-codes
    @gui-codes 6 месяцев назад +1

    Today seemed easy one and I solved it in one go. thanks to you

  • @shikharpandya4927
    @shikharpandya4927 2 месяца назад +1

    Full support to ur channel sir😎

  • @Akashkumar_12
    @Akashkumar_12 6 месяцев назад +3

    Congratulations for 44k subscribers 😊❤

  • @impatientgaming9868
    @impatientgaming9868 6 месяцев назад +1

    Good one, easy solution

  • @anuppatankar4294
    @anuppatankar4294 6 месяцев назад +3

    Congratulations for 44k subscribers 🤝🏻🎉

  • @aizad786iqbal
    @aizad786iqbal 6 месяцев назад +1

    thanks....
    I used this logic instead to count....
    int count=0;
    while(diff!=0){
    if(diff%2!=0){
    count++;
    }
    diff/=2;
    }

  • @ugcwithaddi
    @ugcwithaddi 6 месяцев назад +1

    Should be easy.
    Congratulations on 44k 🎉

  • @OmjiKesharwani-b5t
    @OmjiKesharwani-b5t 2 месяца назад

    sir please make video on minimum number of operations to make string sorted

  • @gauravbanerjee2898
    @gauravbanerjee2898 6 месяцев назад +1

    Thanks a lot bhaiya ❤❤ Congrats for 44k subs 🥳🥳

  • @Schrödinger3
    @Schrödinger3 6 месяцев назад

    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;
    }
    };

  • @tutuimam3381
    @tutuimam3381 6 месяцев назад +1

    Thanks ❤❤❤

  • @newglobal2056
    @newglobal2056 6 месяцев назад +3

    3:42 100❤❤❤

    • @codestorywithMIK
      @codestorywithMIK  6 месяцев назад +2

      Thanks a lot ❤️❤️🙏🙏. Added correction in pinned comment

  • @shah4304
    @shah4304 6 месяцев назад +1

    Gjb yaar

  • @molyoxide8358
    @molyoxide8358 6 месяцев назад +1

    Bro Bit Manipulation per playlist bna do pls.

  • @anshror2583
    @anshror2583 6 месяцев назад +1

    Bhai please make biweekly(129)3 problem

  • @akhilchauhan9417
    @akhilchauhan9417 6 месяцев назад

    bro can you do a series on segment trees?

  • @shabananoor9423
    @shabananoor9423 6 месяцев назад

    ❤❤

  • @vivekkaradbhajne1425
    @vivekkaradbhajne1425 6 месяцев назад

    Did you also heard but 🍑 manipulation

  • @SaurabhKumar-oz2rh
    @SaurabhKumar-oz2rh 6 месяцев назад

    ❤❤