Hashing complexity issue

#1

how the complexity of searching a word through hashing is O(number of strings in the list)?we can just use hash function to find the corresponding index and can just check whether the word is present there or not in O(1) TIME?so why its O(n)?

#2

hi @Rj.25, the complexity for searching a word through hashmap is indeed constant time i.e. O(1) not O( number of strings in the list)

#3

then why in the vido its given that it will take O(n) through hashmap?

#4

please send me the time stamp where he said that , but what i said is true ,he may have meant in some other context

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.