Recursion Problems - 1 | Sum of digits & power of a number | Lecture 28 | C++ and DSA course

Did you watch the last lecture on recursion ? Please, watch it to have a good foundation of the recursion concept.
In this lecture, Sanket Sir will cover some problems based on recursion concepts and give a detailed explanation of each of them with complexity analysis.
Excited?
Let us catch up in the class then!

If you are facing any trouble accessing the assignment or lesson plan, please re-login to your account on PW Skills website and try.

Are you finding the classes helpful?
Stay tuned for more!

Access the notes and assignments for this class for free at : https://bit.ly/3uWnVFp

If you are joining us late, to know more about PWSkills & plans :

Watch the Orientation Video:    • C++ DSA and Java DSA - Orientation Se...  
Watch the Launch Video:    • @CollegeWallahbyPW THIS REVOLUTION WO...  

TIME STAMPS:
00:00 - Introduction
00:39 - Recap
01:17 - Today's Checklist
03:40 - Given an integer, find the sum of digits using recursion
18:57 - Code
21:20 - Dry run
27:57 - Given two numbers p and q, find the value of p^q using a recursive function
41:20 - Code
43:42 - Dry run
50:27 - Optimization of approach to calculate p^q
1:08:45 - Code
1:11:15 - Complexity analysis
1:17:06 - Summary

▶️ PW Skills Website - https://pwskills.com

▶️ PW Skills Instagram -   / pwcollegewallah  

▶️ PW Skills LinkedIn Channel -


▶️ PW Skills Telegram Channel- https://t.me/SkillsPW

#CollegeWallah #PhysicsWallah #PWSkills #Recursion #Recursionconcept #Recursionproblems