Letter Case Permutation
Solution ApproachWas this helpful?
Medium•string•Expected: O(n * 2^k) where k = number of letters in s time, O(n * 2^k) for storing all permutations space
recursion
Problem
Given a string s, you can transform every letter individually to be lowercase or uppercase to create another string.
Return a list of all possible strings we could create. Return the output in any order.
Constraints: 1 <= s.length <= 12. s consists of lowercase English letters, uppercase English letters, and digits.
Example 1:
Input: s = "a1b2"
Output: ["a1b2","a1B2","A1b2","A1B2"]
Example 2:
Input: s = "3z4"
Output: ["3z4","3Z4"]
Reference solution unlocks after your first submission
Loading...