Скачать или смотреть 219. Contains Duplicate II | LeetCode Solution

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 equal to k.

Example 1:
Input: nums = [1,2,3,1], k = 3
Output: true

LeetCode Problem: https://leetcode.com/problems/contain...
Medium Solution:   / 219-contains-duplicate-ii-leetcode-solution  

--------------------------------------------------------------------------------------------------------------
Subscribe to my other Youtube channel for a peek in the life:
☞ Chai & Waffle:    / @chaiwaffle7181  
--------------------------------------------------------------------------------------------------------------
Follow my daily stories on Instagram:
📸 Rajdeep Kaur: @_rajdeepkaur ||   / _rajdeepkaur  
--------------------------------------------------------------------------------------------------------------
Join me on:
🙌 Facebook:   / chai-waffle-106759384959083  
📩 E-mail: [email protected]
--------------------------------------------------------------------------------------------------------------
Hi Everyone, I'm Rajdeep Kaur and I'm an ex-Amazon software engineer. As of now, I am working as a Software Engineer in Miro. I was hired directly from India to Europe (Netherlands).
I make videos on competitive programming, Data Structures and Algorithms and some tips to get hired.
Subscribe for the latest updates, I upload new videos almost everyday :)I hope my content helps you in getting your dream job.