How should I practice Minimum Index Distance Between Two Values?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Dream11 onsite interview problems in FastPrep.

Is Minimum Index Distance Between Two Values associated with Dream11?

FastPrep tags this as a Dream11 onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Minimum Index Distance Between Two Values

Learn this problem

● Easy

Dream11FULLTIMEONSITE INTERVIEW

Problem statement

Given an integer array nums and two distinct integers x and y that each occur at least once, return the minimum value of |i - j| over all indices where nums[i] = x and nums[j] = y.

Function

minimumIndexDistance(nums: int[], x: int, y: int) → int

Examples

Example 1

nums = [3,5,4,2,6,5,6,6,5,4,8,3]x = 3y = 6return = 4

The closest pair is at indices 0 and 4, whose distance is 4.

Example 2

nums = [1,2,1,2]x = 1y = 2return = 1

Values 1 and 2 appear at adjacent indices.

Constraints

2 <= nums.length <= 10^5.
-10^9 <= nums[i], x, y <= 10^9.
x != y, and both values occur at least once.