In one of our final sections of the course, we'll study some hard string problems. Recall that strings are a sequence of characters, either as a literal constant or as some kind of variable, that can have its elements be mutated and length changed.
In this section, we'll study some problems that require a bit more thought than the previous ones. Some of them may involve multiple data structures, and some may involve some clever algorithms. We'll start with a problem that involves a bit of both.
How do I use this section?