Take FREE!! Online Mettl Mock Test to Crack TechM and Other Companies Written Exams.
Get Off-Campus Placement Jobs Info !!!
TCS NQT Technical and Managerial Round Interview Questions

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 ::

Post Your Answer Here:     

No Discussion on this question yet!