MCQOPTIONS
Saved Bookmarks
| 1. |
What is a time complexity for finding the longest prefix that is common between suffix in a string? |
| A. | Ɵ (n) |
| B. | Ɵ (n!) |
| C. | Ɵ (1) |
| D. | O (log n!) |
| Answer» D. O (log n!) | |