Loading
Loading
A log deduplicator flags an event as a repeat only if the same event id appeared within the last k entries.
Return true if any value appears twice at positions no more than k apart.
ids = [1, 2, 3, 1], k = 31 at index 0remember 1 → 01 at index 33 - 0 = 3 ≤ k → repeattrueSign in to keep a note here. It is free, and nobody else can see it.
Sign inExample 1
Sign in to open hints.
Struggling is where the learning happens. Open this once you have genuinely tried, or once the hints have run out.
O(n) time · O(n) space
Input. Run your code to watch it work on this input, one line at a time.
Running code is turned off on this deployment. You can still read the problem, write code, use hints and the visualizer.
Tab moves focus out of the editor. Press Ctrl+M to let Tab indent instead.
No results yet
Run your code against the sample tests, or submit to run the full suite.
The two 1s are exactly 3 apart.
Example 2
The only duplicate is 3 apart, which exceeds k.