Minimum XOR|intuition |Leetcode 2429 |CodeWithShaaz

Java Program to Minimize XOR with Matching Set Bits 🚀
This Java program finds a number x such that:
x has the same number of set bits (1's in binary) as num2.
The XOR of x and num1 is minimized (x XOR num1).
🔍 How It Works:
Count Set Bits: First, it counts the number of set bits in both num1 and num2.
Adjust Bits:
If num1 has fewer set bits than num2, it sets additional bits starting from the least significant bit to match the required count.
If num1 has more set bits than num2, it unsets bits starting from the least significant bit.
Result: The modified x minimizes the XOR result with num1 while matching num2's set bit count.
📊 Example:
Input: num1 = 3 (011), num2 = 5 (101)
Output: 3
Explanation:
num2 has 2 set bits.
num1 already has 2 set bits, so no change is needed.
XOR of 3 ^ 3 = 0 → Minimal XOR!
✨ Key Functions:
isSet(x, bit): Checks if a bit is set in x.
setBit(x, bit): Sets a specific bit in x.
unsetBit(x, bit): Unsets a specific bit in x.
👍 Like | 💬 Comment | 🔔 Subscribe for more coding tutorials!
#Java #Coding #Programming #Tech #LearnJava #XOR #BitManipulation
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝