# Leetcode 1848. Minimum Distance to the Target Element

`Input: nums = [1,2,3,4,5], target = 5, start = 3Output: 1Explanation: nums[4] = 5 is the only value equal to target, so the answer is abs(4 - 3) = 1.`
`Input: nums = [1], target = 1, start = 0Output: 0Explanation: nums[0] = 1 is the only value equal to target, so the answer is abs(0 - 0) = 1.`
`Input: nums = [1,1,1,1,1,1,1,1,1,1], target = 1, start = 0Output: 0Explanation: Every value of nums is 1, but nums[0] minimizes abs(i - start), which is abs(0 - 0) = 0.`
• `1 <= nums.length <= 1000`
• `1 <= nums[i] <= 104`
• `0 <= start < nums.length`
• `target` is in `nums`.
1. check all the nums and if the nums[i] equals to target, check it’s absoulte gap.

--

--

## More from Gary Chiang

CS new grad, 6 years experience related to supply chain management. Located in Bay area

Love podcasts or audiobooks? Learn on the go with our new app.

## Gary Chiang

19 Followers

CS new grad, 6 years experience related to supply chain management. Located in Bay area