Are all values in a subarray distinct? Constant-time range queries

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).