Back to course home
0% completed
Vote For New Content
A straightforward recursive solution
Viktor Pokazanyev
Jan 16, 2026
class Solution: def _permute(self, s, idx, cur_res, result): if idx == len(s): result.append(cur_res) else: if s[idx].isalpha(): self._permute(s, idx + 1, cur_res + s[idx].swapcase(), result) self._permute(s, idx + 1, cur_res + s[idx], result) def findLetterCaseStringPermutations(self, str): permutations = [] self._permute(str, 0, '', permutations) return permutations
0
0
Comments
Comments