Minimum Array End Python Solution with Tests

lcpy gen -n 3133   # by problem number
lcpy gen -s minimum_array_end   # by problem name

Input: n = 3, x = 4
Output: 6
Explanation: nums can be [4, 5, 6] and its last element is 6.

Input: n = 2, x = 7
Output: 15
Explanation: nums can be [7, 15] and its last element is 15.

class Solution:
    # Time: O(1)  # bounded by 64 iterations
    # Space: O(1)
    def min_end(self, n: int, x: int) -> int:
        result = x
        increment = n - 1
        inc_bit = 0
        for bit in range(64):
            if (x >> bit) & 1 == 0:
                if (increment >> inc_bit) & 1:
                    result |= 1 << bit
                inc_bit += 1
        return result