2202. Maximize the Topmost Element After K Moves

You are given a 0-indexed integer array nums representing the contents of a pile, where nums[0] is the topmost element of the pile. In one move, you can perform either of the following: - If the pile is not empty, remove the topmost element of the pile. - If there are one or more removed elements, add any one of them back onto the pile. This element becomes the new topmost element. You are als