We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Since Python's set abstract type is implemented as a hash table, construction of a set of n items is best case (i.e. low load factor) O(n). Therefore first constructing a set then finding its maximum is still O(n).
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Find the Runner-Up Score!
You are viewing a single comment's thread. Return to all comments →
Since Python's set abstract type is implemented as a hash table, construction of a set of n items is best case (i.e. low load factor) O(n). Therefore first constructing a set then finding its maximum is still O(n).