Minimum Distance Mirror Pairs
You are given an array of integers
nums. A 'mirror pair' is defined as a pair of indices (i, j) such that 0 \le i < j < nums.length and the decimal reversal of nums[i] is equal to nums[j]. When reversing an integer, leading zeros are omitted (e.g., reverse(120) = 21). Your task is to find the minimum absolute distance |i - j| among all possible mirror pairs in the array. If no mirror pair exists, return -1. Constraints: 1 \le nums.length \le 10^5 0 \le nums[i] \le 10^9 Time Complexity requirement: O(n) or O(n \log n)JavaHashMap
00