DSAGeeks
Permutation with Case Change
Easy

Problem Statement

Given a string, find all permutations by changing the case of each letter. Digits and symbols remain unchanged.

Examples

1Example 1
Input:
{ "s": "a1b2" }
Output:
[ "a1b2", "a1B2", "A1b2", "A1B2" ]
2Example 2
Input:
{ "s": "ab" }
Output:
[ "ab", "aB", "Ab", "AB" ]
3Example 3
Input:
{ "s": "3z4" }
Output:
[ "3z4", "3Z4" ]
Loading...

Sign in to Run Code and Submit