I understand that Python uses hash method to lookup the keys in the dictionary but if the dictionary grows too large and the key do no longer fit in the hashing result range (collision), how would python handle it ?
how do we handle dictionaries with billions of record(too many keys which will make collision occur at high rate), should we change the hashing function if yes, how to do it ?
