Bhumi Pandey@BhumiPandey06
LeetCode 219 – Contains Duplicate II
Solved: Check if duplicate exists within k distance
Used a hashmap to store last seen index
Compared i - prev_index <= k for match
Perfect use of sliding window + hashing combo!
#LeetCode #PythonDSA #HashMapLogic
00756