

MCQOPTIONS
Saved Bookmarks
1. |
What is a time complexity for finding all the maximal palindrome in a string? |
A. | Ɵ (n) |
B. | Ɵ (n!) |
C. | Ɵ (1) |
D. | O (log n!) |
Answer» B. Ɵ (n!) | |