Complexity should be o(n2)

#1

why complexity in O(n) in last approach. because at each time we are also checking is prefix some is present in unordered set so it should be o(n2)

#2

@anonymous43 if you are using unordered_set then find() function takes constant time

#3

how find function works in unordered_set

#4

@anonymous43 unordered_set is implemented using a hashtable.

#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.