Leetcode 784. Letter Case Permutation

Generate all strings formed by independently toggling the case of each alphabetic character in s (digits remain unchanged). This is an exponential enumeration problem (up to 2^k permutations where k is the number of letters, s.length ≤ 12) typically solved with backtracking or bitmasking.