keshavsingh4522
I want to add the solution to Letter Case Permutation problem on Leetcode (784) using backtracking.
Hi! I want to add the solution to problem 784 (Letter Case Permutation) on Leetcode using concepts of recursion and backtracking.
Here is the description for the problem:
Approach: We start by taking the first letter and adding it to an empty string. We then move forward to the next letter. For each letter, we call the recursive function twice. Once for the original letter, and the then by changing its case (by backtracking). If the letter we're on is a number, we keep it as it is and move forward. Once the length of the string becomes equal to that of the original string. we add it to a vector of strings. At the end, we return this vector with the list of strings containing all Letter Case Permutations.
Please do assign this to me! Thankyou!
