Solving Letter Case Permutation in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Examples:
Input: S = "a1b2"
Output: ["a1b2", "a1B2", "A1b2", "A1B2"]

Input: S = "3z4"
Output: ["3z4", "3Z4"]

Input: S = "12345"
Output: ["12345"]

Note:

See the full details of the problem Letter Case Permutation at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go