Question

Python's built-in dict (dictionary) data structure is typically implemented using a hash table. What is the average-case time complexity for get, set, and del operations in a Python dictionary?

A O(N)
B O(log N)
C O(1)
D O(N log N)
E O(N^2)
Practice Next

Hey! Ask a query