Time complexity

#1

Time complexity of this solution will be O(n2) right?

#2

hello @vishakha_narang

it will be o( n^2 *log(n))

logn because of map access time

#3

Pls correct me if I am wrong . But as far as I know in java map retrieves elements in O(1) time because go hash function

#4

because *of hash function

#5

…

i am talking about c++ ordered map.

in general this is the complexity->
O(n*n * acces time of map)

#6

Oh… could you pls confirm that time complexity in java will beO(n2)

#7

…

u should know about how hasmap work , O(1) is amortied time complexity of hashmap, in worst case it can go O(N) (rare)

so u can say time complexity will be roughly O(N^2) …but not always

#8

I just wanted to confirm . I thought that we can verify questions of this type here.
No issues I will contact the support team .

#9

…

verify what?
question and solution both are correct

#10

the question I asked - time complexity one … not the problem statement

#11

…

read my previous response i already answered it.

if it is not clear then pls study about how hashmap implemented , how distribution of data affect the complexity . what is load factor and how it related to access time.

#12

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.