C++ and DSA Foundation Course - Problem Solving on Recursion - 6 | Lecture 33 | C++ and DSA Foundation Course

Recursion is a simple topic, for only those who practice recursion more and more. In this lecture, we will be solving another set of problems on recursion. Sanket sir will be starting the lecture by giving information on how important and simple recursion is. We will be moving a step ahead in problem-solving by looking at some more interesting problems in recursion. We will be solving some of the important questions related to recursion such as finding the existence of elements, the sum of all subsets, and grid-related problems too. Happy learning, see you all in the lecture. So what are we waiting for? Let us meet in the class! Access the notes and assignments for this class for free at : ▶️https://pwskills.com/course/C++--Foundation Are you finding the classes helpful? Stay tuned for more! PW Skills is announcing the launch of the following programs, Binary Batch:- Java-with-DSA-&-System-Design (Java with DSA & System Design) https://pwskills.com/course/Java-with-DSA-and-system-design (Hindi) https://pwskills.com/course/Java-with-DSA-and-System-Design (English) Sigma Batch:- Full-Stack-Web-Development (MERN Stack) https://pwskills.com/course/Full-Stack-web-development (Hindi) https://pwskills.com/course/Full-Stack-Web-Development (English) Impact Batch:- Data-Science-Masters (Full Stack Data Science) https://pwskills.com/course/Data-Science-masters (Hindi) https://pwskills.com/course/Data-Science-Masters (English) Website - https://pwskills.com/ Instagram - https://www.instagram.com/pwcollegewallah/ LinkedIn - https://www.linkedin.com/company/ineuron-ai https://www.linkedin.com/company/physicswallah/ Telegram - https://t.me/SkillsPW Discord - https://discord.gg/m7YSX6Xh Twitter - https://twitter.com/pw__skills TIME STAMPS: 00:00 - Intro 02:58 - Recap 04:02 - Today's checklist 05:12 - PROBLEM 01 : Print if x exists in the array or not. 23:23 - PROBLEM 01 : Print if x exists in the array or not. Code. 28:00 - PROBLEM 01 : Print if x exists in the array or not. Dry Run. 35:45 - PROBLEM 02 : Print the sum of all subsets in an array. 01:11:22 - PROBLEM 02 : Print the sum of all subsets in an array. Code. 01:16:14 - PROBLEM 02 : Print the sum of all subsets in an array. Dry Run. 01:24:23 - PROBLEM 03 : Count all the possible paths on an m*n grid. 01:41:31 - PROBLEM 03 : Count all the possible paths on an m*n grid. Code. 01:44:00 - PROBLEM 03 : Count all the possible paths on an m*n grid. Dry Run. 01:53:16 - Summary 01:53:44 - Next Lecture 01:54:00 - Outro #C++ #DSA #Recursion #ProblemSolving Lecture33 #BasicProblemsDataStructures #CodingChallenges #Debugging #Recursive #Algorithms #Maths #LogicalThinking #CollegeWallah #PhysicsWallah