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/#:~:t....