Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 219 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 219 # by problem number
lcpy gen -s contains_duplicate_ii # by problem name
nums and an integer k, return true *if there are two distinct indices * i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.
Input: nums = [1,2,3,1], k = 3
Output: true
Input: nums = [1,0,1,1], k = 1
Output: true
Input: nums = [1,2,3,1,2,3], k = 2
Output: false
class Solution:
# Time: O(n)
# Space: O(n)
def contains_nearby_duplicate(self, nums: list[int], k: int) -> bool:
last_seen: dict[int, int] = {}
for i, num in enumerate(nums):
if num in last_seen and i - last_seen[num] <= k:
return True
last_seen[num] = i
return False
| Time | Space |
|---|---|
| O(n) | O(n) |