Java and DSA Foundation Course
Welcome to the Java and DSA Foundation Course! 🚀 This playlist is designed to help you build a solid foundation in Java programming and Data Structures & Algorithms (DSA). Whether you're a beginner or looking to strengthen your coding skills, this course will take you through essential Java concepts and key data structures like arrays, linked lists, stacks, queues, trees, and more. With clear explanations and hands-on examples, you'll be well-equipped to solve coding challenges and prepare for technical interviews. Start your coding journey now and master Java and DSA with us! 💻✨
#Java #DataStructures #Algorithms #DSA #Programming #TechInterviews #CodingForBeginners #FreeCourse
Curated by: College Wallah (71 videos)
Currently Playing: Recursion | Recursion concept and problems | Lecture 27 | Java and DSA Course
Recursion is the first step we take towards the intermediate programming journey. In this lecture manvi ma'am will introduce us to what and why recursion? Later we shall look into the analogy of recursion considering PMI. We shall solve multiple problems, look into the code and also discuss the common error being encountered while solving problems using recursion.
Ready for it ?
See you 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 :
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
Timestamps:-
00:00 Introduction
01:30 Today's checklist
01:56 Recap
06:27 Today's checklist
07:06 Introduction to Recursive functions
08:00 PMI: Principle of Mathematical Induction
17:45 PROBLEM 01 : Print all natural numbers 1 to n using recursion.
26:02 PROBLEM 01 : Print all natural numbers 1 to n using recursion : Code.
28:40 Call Stack.
40:25 PROBLEM 01 : Print all natural numbers 1 to n using recursion : Dry Run.
52:35 PROBLEM 01 : Print all natural numbers 1 to n using recursion : Dry Run Summary.
55:55 Stack Overflow Error.
58:38 Halting Condition or Base Case.
01:01:43 Definition of Recursion.
01:06:00 The Recursion Spell.
01:10:53 Working of Recursive Function Syntax
01:12:26 PROBLEM 02 : Print all natural numbers n to 1 using recursion.
01:18:49 PROBLEM 02 : Print all natural numbers n to 1 using recursion. Code.
01:23:16 PROBLEM 02 : Print all natural numbers n to 1 using recursion. Dry Run.
01:30:47 Why do we need Recursion?
01:31:58 Summary
01:34:31 Next Lecture
▶️ PW Skills Website - https://pwskills.com
▶️ PW Skills Instagram - https://www.instagram.com/pwcollegewallah
▶️ PW Skills LinkedIn Channel -
https://www.linkedin.com/in/pw-skills-136050249/
▶️ PW Skills Telegram Channel- https://t.me/SkillsPW
#Recursion #Java #Dsa #CollegeWallah #PWSkills #PhysicsWallah
Tracks in this Playlist
- Introduction to Java | Java Architecture | Lecture 1 | Java and DSA Foundation Course
- Java in One Shot | Revision - 1 | Output, Input, Variables, Operators | Java Course
- Visual Studio Code Installation on M1 Mac, Windows & Intel Mac | VS Code for Java, C & C++
- IntelliJ Idea Installation | Lecture 2 | Java and DSA Foundation Course
- Variables & Input/Output in Java | Lecture 3 | Java and DSA Foundation Course
- Taking Input in Java : Scanner Class | Lecture 4 | Java and DSA Foundation Course
- Operators in Java | Lecture 5 | Java and DSA Foundation Course
- Bitwise Operators | Java and DSA Foundation Course
- If Else in Java | Revision 2 | Java and DSA Course
- If Else & Switch Statement | Conditionals in Java | Lecture 6 | Java and DSA Foundation Course
- Loops in Java | For/While/Do-while | Lecture 7 | Java and DSA Foundation Course
- Problems on Loops - Part 1 | Using Operators | Lecture 8 | Java and DSA Foundation Course
- Private video
- Problems on Loops - Part 2 | Pattern Printing Problems | Lecture 9 | Java and DSA Foundation Course
- Number Systems | Decimal & Binary | Lecture 10 | Java and DSA Foundation Course
- Introduction to OOPs | Classes and Objects | Lecture 11 | Java and DSA Foundation Course
- Java Methods | Declaring and Calling Methods | Lecture 12 | Java and DSA Foundation Course
- Methods & Scope | Pass by Value & Pass by Reference | Lecture 13 | Java and DSA Foundation Course
- Arrays | Types, Declaration, Creation, Operations | Lecture 14 | Java and DSA Foundation Course
- Arrays- 2| Taking Input, Array Reference, Cloning and Copy |Lecture 15| Java & DSA Foundation Course
- Target Sum | Intermediate Coding Practice in Arrays | Lecture 16 | Java and DSA Foundation
- Arrays 4 | Basic Problem Solving - 2 | Lecture 17 | Java and DSA Foundation Course
- Two Pointers | Advanced Problem Solving in Arrays | Lecture 18 | Java and DSA Foundation
- Arrays 6 | Prefix Sum Problems Solving | Lecture 19 | Java and DSA Foundation Course
- 2D Arrays | Why use them, Taking 2D Arrays as Input | Lecture 20 | Java and DSA Foundation Course
- 2D Arrays Practice | Matrix Transpose & Rotation, Pascal's Triangle | Lecture 21 | Java & DSA Course
- 2D Arrays Problem Solving-2 | Spiral Matrix Traversal & Generation | Lecture 22 | Java & DSA Course
- Problem Solving in 2D Arrays - 3 | Prefix Sum | Lecture 23 | Java and DSA Foundation Course
- Java & DSA Course | Arraylist in Java | Collections, Lists, Arraylist Methods & Problem | Lecture 24
- Time and Space Complexity and Big O Notation | How to avoid TLE | Lecture 25 | Java and DSA Course
- Calculating Time Complexity | Problem Solving | Lecture 26 | Java and DSA Foundation Course
- Recursion | Recursion concept and problems | Lecture 27 | Java and DSA Course
- Problem Solving on Recursion-1 | Factorial & nth fibonacci number | Lecture 28 | Java and DSA Course
- Problem Solving on Recursion 2 | Sum of digits & power of a number | Lecture 29 | Java & DSA Course
- Recursion Questions - 3 | k multiples | Alternate Sum Series | | Lecture 30 | Java and DSA Course
- Recursion Questions - 4 | GCD | Euclids Algorithm | Lecture 31 | Java & DSA Course
- Recursion Questions 5 | Recursion on Arrays | Max Value | Sum of arrays | 32 | Java & DSA Course
- Recursion Questions - 6 | Linear Search | Find all indices | Lecture 33 | Java and DSA Course
- Recursion Questions - 7 | Recursion on Strings | Remove occurences | Lecture 34 | Java & DSA Course
- Recursion Questions - 8 | Find Subsequences | Subsets | Lecture 35 | Java and DSA Course
- Recursion Questions 9 | Recursion on Array & Strings | Frog Problem | Lecture 36 | Java & DSA Course
- Bubble Sort Algorithm | Optimized Bubble Sort | Lecture-37 | Java and DSA Foundation course
- Selection Sort Algorithm | Lecture-38 | Java and DSA Foundation course
- Insertion Sort Algorithm | Lecture-39 | Java and DSA Foundation course
- Problem on Sorting Algorithms-1 | Lecture-40 | Java and DSA Foundation course
- Merge Sort Algorithm | Lecture-41 | Java and DSA Foundation course
- Quick Sort Algorithm | Lecture-42 | Java and DSA Foundation course
- Count Sort | Bucket Sort | Radix Sort | Lecture-43 | Java and DSA Foundation course
- Problem Solving on Sorting Algorithms-2 | Lecture-44 | Java and DSA Foundation Course
- Binary Search Algorithm | Lecture-45 | Java and DSA Foundation course
- Search in Rotated Sorted Array Pattern 1 | Lecture-46 | Java & DSA Foundation course
- Binary Search Problems - 2 | Lecture-47 | Java and DSA Foundation course
- Binary Search on answer value Pattern| Lecture - 48 | Java and DSA Foundation Course
- Strings in One Shot | Java Lecture 49 | java srings | strings | stringbuilder |
- Java OOPS One Shot | Java and DSA Foundation course
- Linked List in Java - Part 1 | Lecture 51 | Java and DSA Foundation Course
- Linked List INTERVIEW QUESTIONS in 5 Hours | Java and DSA Foundation course
- Doubly Linked List and Circular Linked List in Java | Lecture 53 | Java and DSA Course
- Stacks : Basic, STL and Implementation | Lecture 54 | Java and DSA Course
- Stacks : Interview Questions | Leetcode Problems | Lecture 55 | Java and DSA Course
- Stacks - Infix, Prefix & Postfix expressions | Lecture 56 | Java and DSA Course
- Queues - Basic, STL and Implementation | Lecture 57 | Java and DSA Course
- Queues - Interview Questions | Leetcode Problems | Lecture 58 | JAVA and DSA Course
- Java Collections Framework in One Shot | Lecture 59 | JAVA and DSA Foundation Course
- Hashmap - Hashing, Internal Working, Collisions & Rehashing | Lecture 60 | JAVA and DSA
- Hashmap - Important Problems | Anagram | Lecture 61 | JAVA and DSA Foundation Course
- Introduction to Hashset & Important Problems | Lecture 62 | JAVA and DSA Foundation Course
- Backtracking - 1 | Lecture 63 | N Queens | Rat In A Maze | Java and DSA Course
- Backtracking - 2 | Lecture 64 | Sudoku Solver | N Knights | Java and DSA Course
- A Big Update 😍 for Our C++ And Java Course | College Wallah
- Binary Trees in One Shot | Complete DSA in Java | DSA in Java