Leetcode 3370. Smallest Number With All Set Bits

Find the smallest integer x ≥ n whose binary representation is all 1s (i.e., x = 2^k − 1 for some k). In other words, determine the minimal k such that 2^k − 1 ≥ n.