|
2 | 2 |
|
3 | 3 | ## NOTE: |
4 | 4 | - All topics will contain problems from LeetCode Easy to Hard, explained in an easy-to-understand manner. |
5 | | -- Complete Custom Implementation of all Data Structures and Algorithms. |
| 5 | +- Complete custom implementation of all Data Structures and Algorithms. |
6 | 6 |
|
7 | 7 | ## Lectures |
8 | 8 | - Introduction to Git |
|
68 | 68 | - Shadowing |
69 | 69 | - Variable Length Arguments |
70 | 70 | - (more content in OOP such as overloading etc) |
71 | | -- Space and Time Complexity Analysis |
72 | | - - Introduction |
73 | | - - Comparisons of various cases |
74 | | - - Solving Linear Recurrence Relations |
75 | | - - Solving Divide and Conquer Recurrence Relations |
76 | | - - Big-O, Big-Omega, Big-Theta Notations |
77 | | - - Get equation of any relation easily - best and easiest approach |
78 | | - - Complexity discussion of all the problems we do |
79 | | - - Space Complexity |
80 | | - - Memory Allocation of various languages |
81 | | - - NP Completeness and Hardness |
82 | 71 | - Recursion |
83 | 72 | - Introduction |
84 | 73 | - Why recursion? |
|
99 | 88 | - Recursion Array Problems |
100 | 89 | - Recursion Pattern Problems |
101 | 90 | - Subset Questions |
| 91 | +- Space and Time Complexity Analysis |
| 92 | + - Introduction |
| 93 | + - Comparisons of various cases |
| 94 | + - Solving Linear Recurrence Relations |
| 95 | + - Solving Divide and Conquer Recurrence Relations |
| 96 | + - Big-O, Big-Omega, Big-Theta Notations |
| 97 | + - Get equation of any relation easily - best and easiest approach |
| 98 | + - Complexity discussion of all the problems we do |
| 99 | + - Space Complexity |
| 100 | + - Memory Allocation of various languages |
| 101 | + - NP Completeness and Hardness |
102 | 102 | - Object Oriented Programming |
103 | 103 | - Introduction |
104 | 104 | - Classes & its instances |
|
0 commit comments