Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

1975. Minimum Distance to the Target Element

My accepted Python solution to LeetCode problem 1975, Minimum Distance to the Target Element, running in 0ms.

  • Difficulty: Easy
  • Python
  • Runtime 0ms
  • Memory 17.4MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 0ms, memory 17.4MB, accepted 2025-12-31.

python
class Solution:
    def getMinDistance(self, nums: List[int], target: int, start: int) -> int:
        min_dist = float('inf')
        for i, num in enumerate(nums):
            if num == target:
                min_dist = min(min_dist, abs(i - start))
        return min_dist

Source