Data Structures & Algorithms Full Course [Abdul Bari] | DSA in C & C++

1.1: Introduction to Data Structures & Algorithms (DSA) [Abdul Bari] DSA Course

2.1: Arrays, Structures & Pointers in C & C++ for DSA [Abdul Bari] DSA Course

2.2: Functions & Parameter Passing in C & C++ for DSA [Abdul Bari] DSA Course

2.3: C++ Basics & OOP Concepts for DSA [Abdul Bari] DSA Course

3.1 : C++ IDE Setup for DSA (Dev-C++, CodeBlocks, Visual Studio, Xcode) [Abdul Bari] DSA Course

3.2 : Debugging C++ Programs for DSA (Dev-C++, CodeBlocks, Visual Studio) [Abdul Bari] DSA Course

4.1 : Stack vs Heap Memory in DSA [Abdul Bari] DSA Course

4.2 : Time and Space Complexity Analysis for DSA [Abdul Bari] DSA Course

4.3 : Abstract Data Types (ADT) in DSA [Abdul Bari] DSA Course

5.1 : Intro to Recursion [Abdul Bari] DSA Course

5.2 : Recursion Stack & Time Complexity [Abdul Bari] DSA Course

5.3 : Lets Code Recursion [Abdul Bari] DSA Course

5.4 : Static & Global Variables in Recursion [Abdul Bari] DSA Course

5.5 : Tail, Head & Tree Recursion [Abdul Bari] DSA Course

5.6 : Indirect Recursion [Abdul Bari] DSA Course

5.7 : Nested Recursion [Abdul Bari] DSA Course

5.8 : Sum of Natural Numbers using Recursion [Abdul Bari] DSA Course

5.9 : Factorial using Recursion [Abdul Bari] DSA Course

5.10 : Power Recursion [Abdul Bari] DSA Course

5.11 : Taylor Series using Recursion [Abdul Bari] DSA Course

5.12 : Taylor Series using Horner’s Rule [Abdul Bari] DSA Course

5.13 : Fibonacci using Recursion [Abdul Bari] DSA Course

5.14 : nCr using Recursion [Abdul Bari] DSA Course

5.15 : Tower of Hanoi [Abdul Bari] DSA Course

5.16 : Quiz 1 Solutions [Abdul Bari] DSA Course

6.1 : Introduction & Declaration of Arrays [Abdul Bari] DSA Course

6.2 : Static vs Dynamic Arrays [Abdul Bari] DSA Course

6.3 : Increasing Array Size [Abdul Bari] DSA Course

6.4 : Two Dimensional (2D) Arrays [Abdul Bari] DSA Course

6.5 : Array Representation & Address Calculation Formulas [Abdul Bari] DSA Course

6.6 : Quiz 2 Solutions (Arrays) [Abdul Bari] DSA Course

7.1 : Array ADT & Insertion in Array with Code | DSA [Abdul Bari]

7.2 : Deletion from Array with Code | DSA [Abdul Bari]

7.3 : Linear Search in Array (Improved) | DSA [Abdul Bari]

7.4 : Binary Search Algorithm & Analysis | DSA [Abdul Bari]

7.5 : Get, Set, Max & Avg Operations on Array | DSA [Abdul Bari]

7.6 : Reverse & Shift Operations on Array | DSA [Abdul Bari]

7.7 : Check if Array is Sorted | DSA [Abdul Bari]

7.8 : Merging Arrays & Set Operations | DSA [Abdul Bari]

7.9 : Complete Array Program in C++ | DSA [Abdul Bari]

7.10 : Array Interview Problems | Student Challenges | DSA [Abdul Bari]

7.11 : Quiz 3 Solutions | Array ADT | DSA [Abdul Bari]

8.1 : Introduction to Strings & Finding Length | DSA [Abdul Bari]

8.2 : String Operations – Case Change, Validation & Counting | DSA [Abdul Bari]

8.3 : Reverse, Compare & Palindrome in Strings | DSA [Abdul Bari]

8.4 : Finding Duplicate Characters in a String | DSA [Abdul Bari]

8.5 : Check if Two Strings are Anagram | DSA [Abdul Bari]

9.1 : Introduction to Matrices | DSA [Abdul Bari]

9.2 : Diagonal Matrix with C and C++ Implementation | DSA [Abdul Bari]

9.3 : Lower Triangular Matrix – Mapping & Implementation | DSA [Abdul Bari]

9.4 : Upper Triangular Matrix – Row & Column Major Mapping | DSA [Abdul Bari]

9.5 : Special Matrices – Symmetric, Tri-Diagonal & Toeplitz | DSA [Abdul Bari]

9.6 : Menu Driven Matrix Programs in C & C++ | DSA [Abdul Bari]

10.1 : Sparse Matrix Concepts & Array Representation | DSA [Abdul Bari]

10.2 : Sparse Matrix Implementation in C & C++ | DSA [Abdul Bari]

10.3 : Polynomial Representation, Evaluation & Addition | DSA [Abdul Bari]

11.1 : Linked List Introduction & Concepts | DSA [Abdul Bari]

11.2 : Display / Traversal of Linked List | DSA [Abdul Bari]

11.3 : Counting & Sum of Linked List Elements | DSA [Abdul Bari]

11.4 : Maximum Element in Linked List | DSA [Abdul Bari]

11.5 : Searching in Linked List | DSA [Abdul Bari]

11.6 : Insert in Linked List (Theory + Code) | DSA [Abdul Bari]

11.7 : Creating a Linked List (Insertion Examples) | DSA [Abdul Bari]

11.8 : Insert in Sorted Linked List (Theory + Code) | DSA [Abdul Bari]

11.9 : Deletion in Linked List (Theory + Code) | DSA [Abdul Bari]

11.10 : Check if Linked List is Sorted (Theory + Code) | DSA [Abdul Bari]

11.11 : Remove Duplicates from Sorted Linked List (Theory + Code) | DSA [Abdul Bari]

11.12 : Reversing Linked List (Iterative & Recursive + Code) | DSA [Abdul Bari]

11.13 : Concatenation & Merging of Linked Lists | DSA [Abdul Bari]

11.14 : Loop Detection in Linked List (Theory + Code) | DSA [Abdul Bari]

11.15 : C++ Class Implementation for Linked List | DSA [Abdul Bari]

11.16 : Circular Linked List (Theory + Display + Code) | DSA [Abdul Bari]

11.17 : Circular Linked List Insertion & Deletion (Code) | DSA [Abdul Bari]

11.18 : Doubly Linked List Insertion & Deletion (Code) | DSA [Abdul Bari]