Leetcode solving: 1848 Minimum Distance to the Target Element

Leetcode solving: 1848 Minimum Distance to the Target Element

Given an integer array nums (0-indexed) and two integers target and start, find an index i such that nums[i] == target and abs(i - start) is minimized. Note that abs(x) is the absolute value of x.

Return abs(i - start).

It is guaranteed that target exists in nums.

##############

My other Leetcode solving videos (easy)

https://www.youtube.com/playlist?list=PLg9w7tItBlZt4oUpNyWU_0rOItlScu1_d

Leetcode solving videos (Medium):

https://www.youtube.com/playlist?list=PLg9w7tItBlZvMGxy-y1eXURPD6Ao6kkzA

Leetcode solving videos (Hard):

https://www.youtube.com/playlist?list=PLg9w7tItBlZt4JQmlkGD3M5idZn14NyL6

############ ... https://www.youtube.com/watch?v=c0zyxLY9uDU