You are given an integer array nums of length n.

In one operation, you can select any index i and replace nums[i] with a positive palindromic integer x. The cost associated with this operation is $|$nums[i] - x$|$.

An array is defined as equalindromic if all its elements are equal to the same positive palindromic integer.

Return the minimum total cost needed to make the array nums equalindromic.

Note: A palindromic number is a positive integer that reads the same forwards and backwards.

Constraints:

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.