What is a time complexity for finding the longest substring that is common in string S1 and S2 (n1 and n2 are the string
Posted: Wed Jul 13, 2022 7:43 pm
a) O (log n!)
b) Ɵ (n!)
c) O (n2+ n1)
d) Ɵ (n1 + n2)
b) Ɵ (n!)
c) O (n2+ n1)
d) Ɵ (n1 + n2)