Скачать или смотреть Coding Challenge from Leetcode - Contains Duplicate II!

Here is the problem and solution to a coding challenge from Leetcode.com called Contains Duplicate II!

Problem:
Given an integer array 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) less than or equal to k.

Solution summary:
— Intuition / tip: Think of ‘k’ as a range, or window, into the array, in which to check for duplicates. Loop through the array, checking for duplicates within the window, by using a Set data structure. This can be referred to as a Sliding-Window algorithm.
— Initialize a Set; this will only hold unique values
— Loop the array of nums; inside the loop:
— For each num, check if it’s already in the set
— If so, we know we have a duplicate within the range of k, so return true
— If not, add the num to the set
— If the set size is greater than k, remove the first item in the set in order to keep the search window less than or equal to k
— After the loop ends, return false (means no dups in range)
— Time complexity: O(n) where ’n’ is the number of elements of the input string
— Space complexity: O(min(n, k)) where ’n’ is the number of elements of the input string

Let me know if you have any questions or see ways I could have optimized!

Let's connect!
🌐 Website | https://www.kg.codes
📺 Subscribe |    / @kgcodes  
📷 Instagram | www.instagram.com/kg.codes/
🎵 TikTok | https://www.tiktok.com/t/ZTRLxP4wf/
🐦 Twitter | www.twitter.com/kgcodes/

Get my coding gear / desk setup 👨🏾‍💻
📦 Amazon | https://www.amazon.com/shop/kg.codes/...