Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 784. Letter Case Permutation
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source