The lookup of a normal hash function is O(1). Why is the author saying that it's O(n)? https://iq.opengenus.org/time-complexity-of-hash-table/#:~:text=The%20ha

The lookup of a normal hash function is O(1). Why is the author saying that it's O(n)? https://iq.opengenus.org/time-complexity-of-hash-table/#:~:text=The%20hash%20key%20is%20calculated,complexity%20is%20O(1) https://iq.opengenus.org/time-complexity-of-hash-table/#:~:t....