Leetcode 854. K-Similar Strings

Given two anagram strings (length ≤ 20), find the minimum number of arbitrary swaps of characters in s1 needed to transform it into s2 — essentially the shortest-path in the permutation state space, typically solved via BFS/IDA*/or greedy backtracking with pruning to handle the exponential search.