Recursion Google, Amazon Questions - Dice Throw & Letter Combinations of a Phone Number

Explore advanced recursion techniques through a comprehensive tutorial on solving Google and Amazon interview questions, focusing on "Dice Throw" and "Letter Combinations of a Phone Number" problems. Learn effective problem-solving approaches, thought processes, and solution development for these LeetCode challenges. Gain insights into returning outputs as ArrayLists, counting combinations, and handling custom dice faces. Follow along with code implementations and benefit from timestamps for easy navigation through topics. Enhance your data structures and algorithms skills for technical interviews and participate in the #DSAwithKunal learning initiative by sharing your progress on social media.

Introduction
Q1 : Letter Combinations of a Phone Number
Code for Q1
Returning Q1 output as an ArrayList
Returning the count
Q2 : Number of Dice Rolls with Target Sum
Code for Q2
Returning Q2 output as an ArrayList
Dice with custom number of faces
Outro