CPMagical CP Library

Problem solution · Java

Freedom Trail

Freedom Trail: a Java solution using depth-first search. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Depth-first search
Source
walkccc LeetCode Solutions
Length
33 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Depth-first search

For Freedom Trail, the implementation follows one branch at a time, making it suitable for components, trees, backtracking, or dependency exploration.

  1. Define the state carried into one recursive or stack frame.
  2. Mark or choose the current state before exploring children.
  3. Combine child results or undo the choice when the branch finishes.

Code notes

  • 33 lines of Java from the credited upstream file 514.java.
  • The implementation visibly relies on hash lookup, ordered lookup.
  • 1 loop block detected, together with recursive traversal.

Complexity

Count unique states for graph traversal; for backtracking, count the branching factor and maximum depth.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeFreedom Trail · JavaJava
Use this to learn the idea, then write your own version.
class Solution {  public int findRotateSteps(String ring, String key) {    Map<String, Integer> mem = new HashMap<>();    return dfs(ring, key, 0, mem) + key.length();  }   // Returns the number of rotates of ring to match key[index..n).  private int dfs(final String ring, final String key, int index, Map<String, Integer> mem) {    if (index == key.length())      return 0;    // Add the index to prevent duplication.    final String hashKey = ring + index;    if (mem.containsKey(hashKey))      return mem.get(hashKey);     int ans = Integer.MAX_VALUE;     // For each ring[i] == key[index], we rotate the ring to match the ring[i]    // with the key[index], then recursively match the newRing with the    // key[index + 1..n).    for (int i = 0; i < ring.length(); ++i)      if (ring.charAt(i) == key.charAt(index)) {        final int minRotates = Math.min(i, ring.length() - i);        final String newRing = ring.substring(i) + ring.substring(0, i);        final int remainingRotates = dfs(newRing, key, index + 1, mem);        ans = Math.min(ans, minRotates + remainingRotates);      }     mem.put(hashKey, ans);    return ans;  }}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗