Trie and String Algorithm Problems

Practise 30 trie and string algorithm problems from basics to advanced in Python, C++, Java, JavaScript and TypeScript.

This track covers prefix trees, KMP and Z-function matching, rolling hashes, suffix structures and word search. The problems run from easy to hard, so each idea builds on the one before. Every problem is judged against hidden test cases in five languages.

What you will practise:

• Basics: 7 easy problems such as Where It Hides, Handmade Hash Set and Key Collision Count.
• Core Problems: 17 medium problems such as Repeated Gene Snippets, Compact Word Encoding and String Hash Set.
• Hard Problems: 6 hard problems such as Prefix Score Totals, Border Prefix and Suffix Order.

Start with the basics, move on to the core problems, and try the hard ones when the pattern feels natural. Every problem comes with worked examples and clear constraints. For a full path across all of DSA, see Revquix 80, Revquix 150 and Revquix 300.