Leetcode 3133. Minimum Array End

Given n and x, construct a strictly increasing array of n positive integers whose bitwise AND equals x and return the smallest possible value of the final element. The core challenge is a bit-manipulation/greedy task: preserve all bits set in x across every element while distributing/clearing other bits across elements so the last element is minimized.