Dive into a comprehensive video tutorial on recursion, focusing on level 1 questions to build a strong foundation in data structures and algorithms. Learn through theory, code examples, and practical tips as you tackle ten key problems, including counting from n to 1, calculating products and sums, reversing numbers, and identifying palindromes. Explore different approaches to solving these problems, with detailed explanations and step-by-step guidance. Enhance your problem-solving skills and prepare for technical interviews by participating in the learning-in-public initiative. Access additional resources, including a complete Java DSA playlist, code repositories, and assignments to further support your learning journey.
Recursion - Level 1 Questions - Theory, Code, Tips
Overview
Syllabus
Introduction
Revision
Q-01 : n to 1
Q-02 : 1 to n
Q-03 : Product of n to 1
Q-04 : Sum of n to 1
Q-05 : Sum of digits
Q-06 : Product of digits
Concept : Passing Numbers
Q-07 : Reverse a number
Way-1 for Q-07
Way-2 for Q-07
Q-08 : Palindrome
Q-09 : Count Zeros
Q-10 : Count Steps
Outro
Taught by
Kunal Kushwaha
