This question is from one of the popular books .
Given a sequential file containing 4,300,000,000 integers, how can you find one that appears at least once ?
a) How to solve it with ample quantities of memory
b) External scratch files are allowed but only few hundred bytes of main memory is available.
I am aware of the bit map technique, where we map each integer to a bit and so on.
Any solution to the above problem is greatly appreciated.