Lecture-0 [DSA Introduction]
Lecture-01 [Analyzing Algorithms ( Time Complexity, Space Complexity)]
Lecture-02 [Time and space Complexity Finding]
Lecture-03 [Asymptotic Notation, Complexity Classes]
Lecture-04 [Complexity Classes, Recursion]
Lecture-05 [Recursion and Recurrence Relation]
Lecture-06 [Recurrence Relation Solving Using Recursive Tree & Master Theorem]
Lecture-07 [Master Theorem, Introduction to Divide and Conquer]
Lecture-08 [Finding Minimum and Maximum Using Divide and Conquer Technique]
Lecture-09 [Problems on Maxmin, Power Of An Element, Linear Search, Binary Search]
Lecture-10 [Binary Search & Problem Solving]
Lecture-11 [Problems Binary Search & Merge sort Introduction]
Lecture-12 [Merge Sort Analysis & Problems on Merge sort]
Lecture-13 [Problems On Merge Sort Continued]
Lecture-14 [Mergesort Problems, Quick Sort Introduction]
Lecture-15 [Quick Sort Analysis]
Lecture-16 [QuickSort Ending, Randomised QuickSort, Problems On QuickSort]
Lecture-17 [Inversions Counting, Continuous Subarray Sum, Selection Procedure]
Lecture-18 [Heap Sort -1]
Lecture-19 [Heap Sort-2]
Lecture-20 [Bubble Sort, Selection Sort, Insertion Sort]
Lecture-21 [Greedy Technique, Knapsack problem, Job Sequencing with deadlines]
Lecture-22 [Greedy Technique, Job Sequencing With Deadlines, Huffman Coding]
Lecture-23 [Optimal Merge Pattern, Minimum Cost Spanning Tree]
Lecture-24 [Kruskal algorithm & Problem Solving]
Lecture-25 [Prims Algorithm and Problem Solving]
Lecture-26 [Prims Algorithm Time Complexity & Dijkstras Starting]
Lecture-27 [Dijkstra Algorithm, Problem Solving and Bellman-Ford Algorithm]
Lecture-28 [DP-1, Introduction, Fibinocci Series, Longest Common Subsequence]
Lecture-29 [DP-2, Longest Common Subsequence, 0-1 Knapsack]
Lecture-30 [DP-3, Sum Of Subsets, Matrix Chain Multiplication]