

MCQOPTIONS
Saved Bookmarks
1. |
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) |
Answer» E. | |