LC-2200 Easy LeetCode

2200. Find All K-Distant Indices in an Array

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 67% Topics: Array, Two Pointers

Reading material

Arrays & Hashing 12 min Two Pointers 9 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

# two pointers
class Solution(object):
    def findKDistantIndices(self, nums, key, k):
        """
        :type nums: List[int]
        :type key: int
        :type k: int
        :rtype: List[int]
        """
        result = []
        prev = -1
        for i, x in enumerate(nums):
            if x != key:
                continue
            for j in xrange(max(i-k, prev+1), min(i+k+1, len(nums))):
                result.append(j)
            prev = min(i+k, len(nums)-1)
        return result

Solution from kamyu104/LeetCode-Solutions · MIT