I was discussing with a friend about the Hashset design using mod function as the Hashing function. The time complexity of such implementation appears to be O(N/K) , where N is
