Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.