LeetCode 796: Rotate String
A clear explanation of checking whether one string can become another by repeated left rotations.
5 notes
A clear explanation of checking whether one string can become another by repeated left rotations.
Find the minimum number of times one string must be repeated so another string becomes a substring.
A string-marking guide for adding bold tags around all matched words while merging overlapping and adjacent bold regions.
A clear explanation of checking whether a string can be built by repeating one of its proper substrings.
A clear explanation of finding the first occurrence of one string inside another using direct string matching.