CareerCup

Since the numbers have to be unique, we need to store numbers we have already used.
Also all numbers from 0 and maxValue - should have equal probability of being chosen)

Idea is for each iteration i (i is from 0-count-1),

1> chose random number from 0 -- maxValue-i
2> look in Map<Integer,Integer> , if the number is already seen
3> If not seen, place number in map and also map it to(that is set the value) to maxValue-i and return the number
4> If seen, then get the mapper value for the number, add new entry using mapped value as key and maxValue-i as value, return mapped value


Space -O(count)
Time -O(count)

Very similar to question with ID 5717409575993344 (posting URLs is forbidden).

can you post an example?

vector<int> getRandomNumbers(int count, int maxvalue) {
	srand(time(nullptr));	
	vector<int> randomNumbers(count);
	for (auto i = 0; i < count; i++) {
		randomNumbers[i] = rand() % 1 + maxvalue;
	}
	return randomNumbers;
}