Data Structures :: Trie - Discussion
Home > Data Structures > Trie > MCQs Questions Discussion
5 / 30
Choose the correct option.
What is a time complexity for finding the longest substring that is repeated in a string?
AO (log n!)
BƟ (n!)
CO (n2+ n1)
DƟ (n)
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!