DSA Studio

Suffix Structures Checkpoint

Work fresh traces, diagnose invalid implementations, and identify model boundaries.

Get every question correct to pass this checkpoint. You can review feedback, revise your answers, and submit again.

1. A byte query is inclusive [2,5]. What power exponent removes the prefix before it?
2. P[r+1]-P[l] is used without a base power. What is wrong?

Select one answer.

3. Two unequal same-length byte strings match both fixed fingerprints. What makes the reference answer exact?

Select one answer.

4. A five-byte string has 15 substrings counted by positions. Its adjacent suffix LCP values sum to 5. How many distinct substring values does it have?
5. A workload repeats a query comparing two long equal substrings. What is the exact-verification cost beyond hashing?

Select one answer.

Join Discord