Minimum Absolute Distance Between Mirror Pairs
You receive an integer array nums .
A mirror pair is a pair of indices (i, j) such that:
-
0 <= i < j < nums.length, and -
reverse(nums[i]) == nums[j], wherereverse(x)denotes the integer formed by reversing the digits ofx. Leading zeros are omitted after reversing, for examplereverse(120) = 21.
Produce the minimum absolute distance between the indices of any mirror pair. The absolute distance between indices i and j is abs(i - j) .
If no mirror pair exists, produce -1 .
Input: nums = [12,21,45,33,54]
Output: 1
Explanation: The mirror pairs are:
-
(0, 1) since
reverse(nums[0]) = reverse(12) = 21 = nums[1], giving an absolute distanceabs(0 - 1) = 1. -
(2, 4) since
reverse(nums[2]) = reverse(45) = 54 = nums[4], giving an absolute distanceabs(2 - 4) = 2.
The minimum absolute distance among all pairs is 1.
Input: nums = [120,21]
Output: 1
Explanation: There is only one mirror pair (0, 1) since reverse(nums[0]) = reverse(120) = 21 = nums[1] .
The minimum absolute distance is 1.
Input: nums = [21,120]
Output: -1
Explanation: There are no mirror pairs in the array.
Constraints
1 <= nums.length <= 10^51 <= nums[i] <= 10^9
Did this problem appear in one of your interviews?
Responses stay private.
