4
Last seen 2 years ago
Member for 4 years, 3 months, 9 days
Difficulty Normal
Liked
a comment created by Phil15
for
forum post "Big O complexity (spoiler)"
`O(n)` where n=len(val), but done at C-speed.
Commented a forum post "Big O complexity (spoiler)" created by
Dascal
Oh! It is faster than O(n log n) in Python.
Thank you
Created a forum post "Big O complexity (spoiler)"
What is time complexity of
[spoiler]
val\[::-1\]
[/spoiler]
?
Created a forum post "Task clarification"
Does statement "It can be only one." mean that in the list only one string is most frequent?
Case [
