Nearby Duplicates

The Proximity Pulse

In high-speed data streams, detecting repeats within a specific "time window" ($K$) is far more important than finding any duplicate at all. By sliding a "window of awareness" across the array, you can instantly detect if a value has reappeared too soon.

The Assignment

Your mission is to detect nearby repeats. Your function receives an array nums and a proximity limit k.

1. Use a Set or Object to track the numbers currently inside your "awareness window."
2. Iterate through the array:
   • If the current number is already in your window, print true and exit.
   • Add the current number to your window.
   • If the window size exceeds k, remove the oldest number (nums[i - k]).
3. If you reach the end without finding a match, print false.