LeetCode 854. K-Similar Strings

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

greedy also comes in mind when doing ask for minimum or smallest.

vaibhavvashist
Автор

Thanks for showing both the approaches (BFS, backtracking). The problem states that A and B are anagrams so finally we will get transformed A == B.
This problem is similar to LC 126, 127 (word ladders), LC 752 (lock combinations). LC 784 (letter case permutations).

anant
visit shbcf.ru