For each index i, how can we check if nums[i] can be present at the top of the pile or not after k moves?

For which conditions will we end up with an empty pile?