Leetcode 2429. Minimize XOR

Given num1 and num2, find an integer x with the same number of set bits as num2 that minimizes num1 XOR x. This reduces to placing x's 1-bits to match num1's 1-bits as much as possible (favoring higher-significance positions) and filling remaining bits in the least-significant positions to minimize the XOR.