Java DSA Series

DSA Complete Series 🚀 : Data Structures & Algorithms || 150 day Challenge

Lecture 1: Flowchart & Pseudocode + Basics || DSA Series by Babbar || Java

Lecture 2: How a Java Program Run || DSA Series by Babbar

Lecture 3: IDE Setup for Coding || DSA Series by Babbar || Java

Lecture 4: Write your FIRST Java Program || DSA Series by Babbar

Lecture 5: VARIABLES in Java || DSA Series by Babbar

Lecture 6: DataTypes in Java || DSA Series by Babbar

Lecture 7: Operators in Java || DSA Series by Babbar

Lecture 8: Input/Output in Java || DSA Series by Babbar

Lecture 9: Conditionals in Java || DSA Series by Babbar

Lecture 10: Loops in Java || DSA Series by Babbar

Lecture 11: Solve any PATTERN Printing Problem using this TRICK || DSA Series by Babbar

Lecture 12: Methods in Java || DSA Series by Babbar

Lecture 13: Arrays in Java || DSA Series by Babbar

Lecture 14: Strings in Java || DSA Series by Babbar

Lecture 15: Basic Maths needed for DSA || DSA Series by Babbar

Lecture 16: Intro to OOPs Concepts || DSA Series by Babbar

Lecture 17: Classes, Objects, Constructors, Object Lifecycle in JAVA || DSA Series by Babbar

Lecture 18: Encapsulation in JAVA || DSA Series by Babbar

Lecture 19: Inheritance in Java || DSA Series by Babbar

Lecture 20: Polymorphism in Java || DSA Series by Babbar

Lecture 21: Abstraction in Java || DSA Series by Babbar

Lecture 22: Time & Space Complexity || DSA Series by Babbar

Lecture 23: Java Collection Framework ( Part-1 ) || DSA Series by Babbar

Lecture 24: Java Collection Framework ( Part-2 ) || DSA Series by Babbar

Lecture 25: Java Collection Framework ( Part-3 ) || DSA Series by Babbar

Lecture 26: Bitwise Operators in Java || DSA Series by Babbar

Lecture 27: Array Problem Solving Part-1 || DSA Series by Babbar

Lecture 28: Array Manipulation Problems || DSA Series by Babbar

Lecture 29: Array Problem Solving Part-3 || DSA Series by Babbar

Lecture 30: Array Problem Solving Part-4 || DSA Series by Babbar

Lecture 31: Missing Elements from an Array of Duplicates || Array Problem || DSA Series by Babbar

Lecture 32: Maximum Sum Contiguous SubArray || Kadane's Algorithm || DSA Series by Babbar

Lecture 33: Solving 2D Array Problems || DSA Series by Babbar

Lecture 34: Rotate and Spiral Print a Matrix || DSA Series by Babbar

Lecture 35: Sorting Algorithms || DSA Series by Babbar

Lecture 36: Binary Search in 1 Video || DSA Series by Babbar

Lecture 37: Upper/Lower Bound, Number of Occurrences Binary Search || DSA Series by Babbar

Lecture 38: Find PEAK of MOUNTAIN Array || DSA Series by Babbar

Lecture 39: Search in a Rotated Sorted Array || DSA Series by Babbar

Lecture 40: Binary Search on Answers PATTERN || DSA Series by Babbar

Lecture 41: Book Allocation Problem || Min-Max Binary Search Pattern || DSA Series by Babbar

Lecture 42: Painter's Partition Problem || DSA Series by Babbar

Lecture 43: Aggressive Cows Problem || DSA Series by Babbar

Lecture 44: EKO SPOJ Problem || Binary Search || DSA Series by Babbar

Lecture 45: ROTI PRATA SPOJ Problem || DSA Series by Babbar

Lecture 46: Search in Nearly Sorted Array || Binary Search || DSA Series by Babbar

Lecture 47: Find Single Non-Duplicate element using Binary Search || DSA Series by Babbar

Lecture 48: Search in 2D Matrix I and II (Binary Search) || DSA Series by Babbar

Lecture 49: Row with Maximum 1's || Binary Search || DSA Series by Babbar

Lecture 50: Unbounded Search using Binary Search Concept || DSA Series by Babbar

Lecture 51: Reverse Words in a Strings || DSA Series by Babbar

Lecture 52: String Interview Questions Part-2 || DSA Series by Babbar

Lecture 53: String Interview Problems Part-3 || DSA Series by Babbar

Lecture 54: Recursion Basics || Recursion Series Day-1 || DSA Series by Babbar

Lecture 55: Recursive Time & Space Complexity || Recursion Series Day-2 || DSA Series by Babbar

Lecture 56: Climbing Stairs problem || Recursion Series Day-3

Lecture 57: Recursion Basics || Recursion Day-4

Lecture 58: Recursive BINARY SEARCH || Recursion Day-5

Lecture 59: Subsequences of String || Recursion Series Day-6

Lecture 60: House Robber Problem || Recursion Series Day-7

Lecture 61: Coin Change 2 Problem || Recursion Series Day-8

Lecture 62: COin Change I Problem || Recursion Series Day-9

Lecture 64: Minimize the Difference Between Target and Chosen Elements || Recursion Series Day-11

Lecture 63: Partition Equal Subset Sum Problem || Recursion Series Day-10

Lecture 65: Jump Game Problem || Recursion Series Day-12

Lecture 66: Leetcode Triangle Problem || Recursive Series Day-13

Lecture 67: Subsequences with Sum K || Recursion Series Day-14

Lecture 68: Subsets 1 & Subsets II Problem || Recursion Series Day-15

Lecture 69: Combination Sum (All 3 *variants*) || Recursion Series Day-16

Lecture 70: Permutations of String || Recursion Series Day-17

Lecture 71: Intro to Backtracking || Recursion Series Day-18

Lecture 72: Phone Keypad Problem || Recursion Series Day-19

Lecture 73: N-Queen Problem || Recursion Series Day-20

Lecture 74: Sudoku Solver Problem || Recursion Series Day-21

Lecture 75: Merge Sort in 1 Video || Recursion Series Day-22

Lecture 76: Inversion Count in an Array || Recursion Day-23

Lecture 77: Quick Sort in 1 Video || Recursion Day - 24

Lecture 78: Starting Linked List Series || Day - 1

Lecture 79: All about Doubly Linked List || Linked List Series Day - 2

Lecture 80: Circular Linked List || Linked List Series Day-3

Lecture 81: Reverse a Linked List || Linked List Series Day-4

Lecture 82: Middle Node of Linked List || Linked List Series Day-5

Lecture 83: Check Palindrome Linked List || Linked List Series Day-6

Lecture 84: Check Cycle in Linked List || Linked List Series Day-7

Lecture 86: Remove Duplicate Nodes from LL || Linked List Series Day-9

Lecture 87: Kth node from end of LL || Linked List Series Day-10

Lecture 88: Odd-Even Linked List || Linked List Series Day-11

Lecture 89: Merge Nodes in between Zeroes || Linked List Series Day-12

Lecture 90: Add 1 to LL || Linked List Series Day-13

Lecture 91: Intersection of 2 Linked List || Linked List Series Day-14

Lecture 92: Rotate Linked List || Linked List Series Day-15

Lecture 93: Sort LL of 0's, 1's and 2's || Linked List Series Day-16

Lecture 94: Swap Nodes in LL || Linked List Series day-17

Lecture 95: Delete N Nodes After M Nodes || Linked List Series Day-18

Lecture 97: DETECT Starting Node of CYCLE in Linked List || LL Series Day-20

Lecture 98: Partition a Linked List || LL Series Day-22

Lecture 96: Add 2 numbers in Linked List || LL Series Day-19

Lecture 99: Split a LL into Parts || Linked List Series Day-22

Lecture 100: Reverse LL in Groups of K || Linked List Series Day-23

Lecture 101: Flatten a Multi-Level LL || Linked List Series Day-24

Lecture 102: Find Nodes between Critical Points || Linked List Series Day-25

Lecture 103: Double a Number in Linked List || Linked List Series Day-26

Lecture 104: Deep Copy a Linked List || Linked List Series Day-27