Q92
What is time complexity to check if a string(length S1) is a substring of another string(length S2) stored in a Directed Acyclic Word Graph, given S2 is greater than S1?
A.
O(S1)
AnswerB.
O(S2)
C.
O(S1+S2)
D.
O(1)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board