Grokking the Coding Interview: Patterns for Coding Questions
Ask Author
Back to course home

0% completed

Solution: String Permutations by changing case

Problem Statement

Given a string, find all of its permutations preserving the character sequence but changing case.

Example 1:

Input: "ad52"
Output: "ad52", "Ad52", "aD52", "AD52"

Example 2:

Input: "ab7c"
Output: "ab7c", "Ab7c", "aB7c", "AB7c", "ab7C", "Ab7C", "aB7C", "AB7C"


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


This problem follows the Subsets pattern and can be mapped to Permutations.




Like the course? Get enrolled and start learning!