2 Doubts in video

[vishakha_narang]

1. Is there a way to tell that we will not end up in an infinite loop.(Except Dry run)

2. Did not understand - loading of hashMap will take O(N) time.

[aman212yadav (Aman Yadav)]

hello @vishakha_narang

@vishakha_narang

Is there a way to tell that we will not end up in an infinite loop.(Except Dry run)

use hash map to keep track of visited values if any value visited again then that means loop is present otherwise not.

@vishakha_narang

Did not understand - loading of hashMap will take O(N) time.

pls mention the timestamp where it is discussed

[vishakha_narang]

time - 3:55 . Does it mean creating takes O(N) time and searching O(1)

[vishakha_narang]

My first doubt is on the explanation at 6:10

[aman212yadav (Aman Yadav)]

@vishakha_narang

time - 3:55 . Does it mean creating takes O(N) time and searching O(1)

what bhaiya was explaining is if u have to prepare map for n values then it will take O(N).

otherwise average searchtime is O(1).

@vishakha_narang

My first doubt is on the explanation at 6:10

yeah . check this->link

[aman212yadav (Aman Yadav)]

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.