Summary
Keywords
Full Transcript
In this lecture, we will be continuing with solving problems related to Recursion in Arrays. Today Manvi maam will introduce us to the linear search algorithm using Recursion. We will be solving multiple problems related to the implementation of searching algorithms using recursion. Happy learning! See you all in the lecture. 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 Access the notes and assignments for this class for free at : ▶️https://pwskills.com/course/Cracking-the-Coding-Interview-in-Java---Foundation If you are joining us late, to know more about PWSkills & plans : Watch the Orientation Video: https://www.youtube.com/watch?v=YpNFgTKVAtU Watch the Launch Video: https://www.youtube.com/watch?v=si8TKULKmLE TIME STAMPS: 00:00 - Intro 00:10 - Recap 05:38 - Today's checklist 05:54 - PROBLEM 01: Print whether x exists in the array or not. 18:18 - PROBLEM 01: Print whether x exists in the array or not. Code. 27:36 - PROBLEM 01: Print whether x exists in the array or not. Recursive Tree. 29:53 - PROBLEM 01: Print whether x exists in the array or not. Dry Run. 37:50 - PROBLEM 02: Return index if x exists in the array. 41:46 - PROBLEM 03: Return all indeces if x exists in the array. 45:52 - PROBLEM 03: Return all indeces if x exists in the array. Code. 48:44 - PROBLEM 03: Return all indeces if x exists in the array. Recursive Tree. 52:00 - PROBLEM 04: Return all indices as Array List if x exists in the array. 01:06:50 - PROBLEM 04: Return all indices as Array List if x exists in the array. Dry Run. 01:26:16 - Follow-up Questions. 01:27:51 - Summary 01:28:55 - Next Lecture 01:29:29 - Outro #Coding #Java #Tutorial #Recursion #ProblemSolving #JavaLecture32 #Problem #Solving #Math #Solution #DSA #DataStructure #Algorithm #Java #CollegeWallah #PWSkills #PhysicsWallah
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
