Letter Case Permutation Problem

Letter Case Permutation Problem — ExecCode Medium DSA Practice

Solve the Letter Case Permutation problem on ExecCode. Free online medium DSA practice in String. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description 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. 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.

Examples

Input s = "a1b2"; Output ["a1b2", "a1B2", "A1b2", "A1B2"]. Input s = "3z4"; Output ["3z4", "3Z4"]

Constraints

1 <= s.length <= 12 s consists of lowercase English letters, uppercase English letters, and digits.

Practice Letter Case Permutation free on ExecCode. Browse DSA problems, topic map, and placement guides.