Q98
What is a time complexity for checking a string of length n is substring or not?
A.
O (log n!)
B.
O (n!)
C.
O (n2)
D.
O (n)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board