Contains Duplicate II Tamil Tutorial C++ (LeetCode 219 Easy)
Hey Guys! I teach competitive coding questions in Tamil:)
Any suggestions welcome:)
Thanks for watching :D
Follow me on Instagram (@code_chak): https://instagram.com/code_chak?igshi...
Follow me on LinkedIn: / akhilchakravarthy
Problem link: https://leetcode.com/problems/contain...
Problem Description:
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.
Example 1:
Input: nums = [1,2,3,1], k = 3
Output: true
Example 2:
Input: nums = [1,0,1,1], k = 1
Output: true
Example 3:
Input: nums = [1,2,3,1,2,3], k = 2
Output: false