#3740

Minimum Distance Between Three Equal Elements I

easy · 60.5% accepted · 59 likes · top 59%

array · hash table

⊣ practice⊣ open on leetcode ↗

Description

You are given an integer array nums.

A tuple (i, j, k) of 3 distinct indices is good if nums[i] == nums[j] == nums[k].

The distance of a good tuple is abs(i - j) + abs(j - k) + abs(k - i), where abs(x) denotes the absolute value of x.

Return an integer denoting the minimum possible distance of a good tuple. If no good tuples exist, return -1.

Solution