Minimum Cost to Make Array Equalindromic

Choose a palindromic integer y (< 1e9) to change all elements of nums to, minimizing the total cost sum |nums[i]-y|; this is an L1 minimization problem over the discrete set of palindromic numbers (i.e., pick the palindromic value nearest the median).