Package g0701_0800.s0784_letter_case_permutation

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    784 - Letter Case Permutation.

    Medium

    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.

    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.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<String> letterCasePermutation(String s)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait