I understands codes more when it's been coded than explained on paper or board. You explained it very well, and it's actually easy to comprehend. Thank you!
I managed to recreate the code with some improvements. You can treat the 'slate' like a string and just append the upper/lower/number characters into the recursive call. At the end of the function the return statement will "pop" off the appended string for you (at least from what I could tell). You also don't need to slice or join your built string either. Really cool exercise and I learned a lot. Here are my two recursive calls for upper/lower: permuteLetterCase(sarray, currentIndex + 1, builtStr + sarray[currentIndex].toUpperCase()); permuteLetterCase(sarray, currentIndex + 1, builtStr + sarray[currentIndex].toLowerCase()); And the case for a number: permuteLetterCase(sarray, currentIndex + 1, builtStr + sarray[currentIndex]); Your explanation helped a ton though.
Hey Andy, love your tutorials. They’ve been helpful. Can I ask what program you’re using to sketch/draw out the work? And do you have a pen/drawing pad situation?
Good stuff! What is an example or problem statement where we would need the Backtrack case you mentioned, which this specific one didn't require it? How would that be handled?
I understands codes more when it's been coded than explained on paper or board. You explained it very well, and it's actually easy to comprehend. Thank you!
I managed to recreate the code with some improvements. You can treat the 'slate' like a string and just append the upper/lower/number characters into the recursive call. At the end of the function the return statement will "pop" off the appended string for you (at least from what I could tell). You also don't need to slice or join your built string either. Really cool exercise and I learned a lot.
Here are my two recursive calls for upper/lower:
permuteLetterCase(sarray, currentIndex + 1, builtStr + sarray[currentIndex].toUpperCase());
permuteLetterCase(sarray, currentIndex + 1, builtStr + sarray[currentIndex].toLowerCase());
And the case for a number:
permuteLetterCase(sarray, currentIndex + 1, builtStr + sarray[currentIndex]);
Your explanation helped a ton though.
Thanks so much for this! With visual representation it's much easier to understand
so glad I found your channel!!
The way you explain is phenomenal. You're a natural teacher!
Thanks, Akhil! Appreciate the support!
Great explanation, clear, simple to the point.
absolutely beautiful
👌👌
you explain things really well, thank you
Thank you!
Hey Andy, love your tutorials. They’ve been helpful. Can I ask what program you’re using to sketch/draw out the work? And do you have a pen/drawing pad situation?
Good stuff! What is an example or problem statement where we would need the Backtrack case you mentioned, which this specific one didn't require it? How would that be handled?
please make more videos andy bro ... your tutorial are very hel[full
Isn't the Space complexity O(N) , N being the maximum depth of the tree( amount of function calls in the call stack) at any given moment?
My code is not running
what happend to your code