Implement Containing Nearby Duplicate Problem

[SjxSubham]

Intuition

We have to find if the last occurence of the number in the array is lesser than or equal to k.So using hash maps find where the number appeared last and check if the distance is lesser thea k.

Approach

First find size of array,initialize a hash map.
Current number is assigned as the iterated index value of array.
we check if in the map the current number occurs anywhere.If it does then find the previous index of the number in the map,and check if the distance from current index to previous index is less than or equal to k which is given.if it is then return true.if current number is not there in the map,add it to it. and return false outside the for loop if the distance is greater or not found.

[github-actions]

🎉 Congrats on getting your PR merged in, @SjxSubham! 🙌🏼

Thanks for your contribution every effort helps improve the project.

Looking forward to seeing more from you! 🥳✨