Pergunta de entrevista da empresa NASA Jet Propulsion Laboratory

What's the time complexity of a dictionary access

Resposta da entrevista

Sigiloso

25 de out. de 2019

O(1) in general, O(n) worst case