|
1 | 1 | # Complete Java + DSA Bootcamp Syllabus |
2 | 2 |
|
3 | 3 | ## NOTE: |
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. |
| 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. |
6 | 6 |
|
7 | 7 | ## Lectures |
8 | 8 | - Introduction to Git |
|
28 | 28 | - Bubble Sort |
29 | 29 | - Count Sort |
30 | 30 | - Radix Sort |
| 31 | + - Cyclic Sort |
31 | 32 | - Searching |
32 | 33 | - Linear Search |
33 | 34 | - Binary Search |
|
51 | 52 | - Newton's Square Root Method |
52 | 53 | - Number Theory |
53 | 54 | - Euclidean algorithm |
54 | | - - Advanced Concepts for CP (later in course) |
| 55 | + - Advanced Concepts for CP (later in the course) |
55 | 56 | - Bitwise + DP |
56 | 57 | - Extended Euclidean algorithm |
57 | 58 | - Modulo Properties |
58 | 59 | - Modulo Multiplicative Inverse |
59 | 60 | - Linear Diophantine Equations |
60 | | - - Fremat's Theorem |
| 61 | + - Fermat’s Theorem |
61 | 62 | - Wilson's Theorem |
62 | 63 | - Lucas Theorem |
63 | 64 | - Chinese Remainder Theorem |
|
68 | 69 | - Shadowing |
69 | 70 | - Variable Length Arguments |
70 | 71 | - (more content in OOP such as overloading etc) |
71 | | -- Space and Time Complexity Analysis |
72 | | - - Introduction |
73 | | - - Comparion 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 |
| 72 | + |
82 | 73 | - Recursion |
83 | 74 | - Introduction |
84 | 75 | - Why recursion? |
|
89 | 80 | - Sorting: |
90 | 81 | - Merge Sort |
91 | 82 | - Quick Sort |
92 | | - - Cyclic Sort |
93 | 83 | - Backtracking |
94 | 84 | - Sudoku Solver |
95 | 85 | - N-Queens |
|
99 | 89 | - Recursion Array Problems |
100 | 90 | - Recursion Pattern Problems |
101 | 91 | - Subset Questions |
| 92 | +- Space and Time Complexity Analysis |
| 93 | + - Introduction |
| 94 | + - Comparisons of various cases |
| 95 | + - Solving Linear Recurrence Relations |
| 96 | + - Solving Divide and Conquer Recurrence Relations |
| 97 | + - Big-O, Big-Omega, Big-Theta Notations |
| 98 | + - Get equation of any relation easily - best and easiest approach |
| 99 | + - Complexity discussion of all the problems we do |
| 100 | + - Space Complexity |
| 101 | + - Memory Allocation of various languages |
| 102 | + - NP-Completeness and Hardness |
102 | 103 | - Object Oriented Programming |
103 | 104 | - Introduction |
104 | 105 | - Classes & its instances |
|
128 | 129 | - Fast and slow pointer |
129 | 130 | - Cycle Detection |
130 | 131 | - Single and Doubly LinkedList |
131 | | - - Reversalof LinekdList |
| 132 | + - Reversal of LinkedList |
132 | 133 | - Dynamic Programming |
133 | 134 | - Introduction |
134 | 135 | - Recursion + Recursion DP + Iteration + Iteration Space Optimized |
135 | 136 | - Complexity Analysis |
136 | 137 | - 0/1 Knapsack |
137 | 138 | - Subset Questions |
138 | 139 | - Unbounded Knapsack |
139 | | - - Subseq questions |
| 140 | + - Subsequence questions |
140 | 141 | - String DP |
141 | 142 | - Trees |
142 | 143 | - Introduction |
|
154 | 155 | - Priority Queue |
155 | 156 | - Two Heaps Method |
156 | 157 | - k-way merge |
157 | | - - top k elements |
158 | | - - interval problems |
159 | | -- Hashmaps |
| 158 | + - Top k elements |
| 159 | + - Interval problems |
| 160 | +- HashMap |
160 | 161 | - Introduction |
161 | 162 | - Theory - how it works |
162 | 163 | - Comparisons of various forms |
|
178 | 179 | - Dijkstra’s shortest path algorithm |
179 | 180 | - Topological Sort |
180 | 181 | - Bellman ford |
181 | | - - A* pathfinding Algorithm |
| 182 | + - A* pathfinding Algorithm |
0 commit comments