← Questions
Are all values in a subarray distinct? Constant-time range queries
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given an integer array and a range [l, r], decide whether no value appears twice among nums[l..r].
Then many ranges will be queried against the same array. Preprocess it so each query is answered in O(1).
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