How to Find the Minimum Mirror Pair Distance in an Array

Have you ever encountered an algorithm problem where you need to find pairs of numbers that are "mirrors" (reversals) of each other? Recently, I was working on an interesting array problem: Finding the minimum distance between two indices containing mirror pairs. For example, 12 and 21 are mirror pairs. If they appear in an array, we want to find the shortest distance between their indices. In this post, I'll walk you through an efficient Java solution that solves this problem in a single pass u