← Questions
Duplicate detection: sliding windows, then read-heavy queries
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Start with checking an array for duplicate values, then evolve the solution step by step: first find duplicates that fall within a sliding window of positions, then rework the design for a read-heavy workload where the same data is queried many times. Explain the data structures and trade-offs at each step.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding