College Subject Practice · College Year 2
String Algorithms practice questions — College Subject Practice · College Year 2 Algorithms
Practise string algorithms with topic-based questions. Preview a sample, then start a short session.
See the question style before signup · Get instant feedback · Continue with focused practice
Try a sample question
Check your answer to see the explanation where one has been published.
Try this question
After building a suffix tree or suffix array for text , searching for a pattern of length can be done in time about:
1 sample question · No signup needed
2
The Burrows-Wheeler Transform (BWT), central to the FM-index used in genomic search, is closely related to which structure?
3
A suffix tree for a string of length (with a unique terminator) has exactly how many leaves?
Start a sample session
50 published questions available for this topic.