Q72
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)?
A.
O (log n!)
B.
Ɵ (n!)
C.
O (n2+ n1)
D.
Ɵ (n1 + n2)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board