Solution: Freedom Trail
Understand how to apply dynamic programming to solve the Freedom Trail problem. Explore recursive memoization that minimizes ring rotations and button presses needed to spell a key sequence on a circular ring.
We'll cover the following...
Statement
You are given a circular ring represented by a string ring, and a keyword represented by a string key that you need to spell out.
Initially, the first character of ring (index key sequentially, you must:
Rotate the
ringclockwise or anticlockwise. Each rotation by one position counts as one step. Rotate until a character inringthat matches the current target characterkey[i]is aligned at the "12:00" position.Press the center button to confirm the character, which counts as one additional step.
After pressing, you move on to spell the next character in key. The ring is circular, meaning its last character wraps around to its first character.
Return the minimum total number of steps required to spell all characters in key.
Note: Each button press counts as one step in addition to the rotation steps.
Constraints:
...