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

4 / 30

Choose the correct option.

What is a time complexity for finding the longest substring that is common in string S1 and S2 (n1 and n2 are the string lengths of strings s1, s2 respectively)?

AO (log n!)

BƟ (n!)

CO (n2+ n1)

DƟ (n1 + n2)

Answer: Option (Login/Signup)

Show Explanation

Asked In ::

Post Your Answer Here:     

No Discussion on this question yet!