Practice Letter Case Permutation
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Letter Case Permutation on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
s = "a1b2"
Output
["a1b2","a1B2","A1b2","A1B2"]
# Example 2
Input
s = "3z4"
Output
["3z4","3Z4"]
Constraints
1 <= s.length <= 12
s consists of lowercase English letters, uppercase English letters, and digits.
Related LeetCode Problems
Practice more problems similar to Letter Case Permutation.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.