|
50 | 50 | - [How Strings work](https://youtu.be/zL1DPZ0Ovlo?t=216) |
51 | 51 | - [Comparison of methods](https://youtu.be/zL1DPZ0Ovlo?t=977) |
52 | 52 | - [Operations in Strings](https://youtu.be/zL1DPZ0Ovlo?t=1681) |
53 | | - - [StringBuilder in java](https://youtu.be/zL1DPZ0Ovlo?t=4199) |
| 53 | + - [StringBuilder in Java](https://youtu.be/zL1DPZ0Ovlo?t=4199) |
| 54 | + - [StringBuffer](https://www.youtube.com/watch?v=YFZai3fPUQI) |
54 | 55 | - [Maths for DSA](https://youtu.be/fzip9Aml6og) |
55 | 56 | - [Introduction](https://youtu.be/fzip9Aml6og?t=20) |
56 | 57 | - [Complete Bitwise Operators](https://youtu.be/fzip9Aml6og?t=95) |
|
63 | 64 | - [Number Theory](https://youtu.be/lmSpZ0bjCyQ?t=4405) |
64 | 65 | - [HCF / LCM](https://youtu.be/lmSpZ0bjCyQ?t=5110) |
65 | 66 | - [Euclidean algorithm](https://youtu.be/lmSpZ0bjCyQ?t=5520) |
| 67 | + - [BigInteger & BigDecimal](https://www.youtube.com/watch?v=lHtoypC-4Ps) |
66 | 68 | - [Recursion](https://www.youtube.com/playlist?list=PL9gnSGHSqcnp39cTyB1dTZ2pJ04Xmdrod) |
67 | 69 | - [Introduction](https://youtu.be/M2uO2nMT0Bk) |
68 | 70 | - [Flow of recursive programs - stacks](https://youtu.be/M2uO2nMT0Bk?t=2124) |
|
126 | 128 | - [Cycle Detection](https://youtu.be/70tx7KcMROc) |
127 | 129 | - [Reversal of LinkedList](https://youtu.be/70tx7KcMROc) |
128 | 130 | - [Linked List + Recursion](https://youtu.be/70tx7KcMROc) |
129 | | -- Stacks & Queues |
| 131 | +- [Stacks & Queues](https://www.youtube.com/watch?v=rHQI4mrJ3cg) |
130 | 132 | - Introduction |
131 | | - - Interview problems |
132 | 133 | - Push efficient |
133 | 134 | - Pop efficient |
134 | | - - Queue using Stack and Vice versa |
| 135 | + - Queue using Stack and vice versa |
135 | 136 | - Circular Queue |
136 | | -- Trees |
137 | | - - Introduction |
138 | | - - Binary Trees |
139 | | - - Binary Search Trees |
140 | | - - DFS |
141 | | - - BFS |
142 | | - - AVL Trees |
143 | | - - Segment Tree |
| 137 | + - [Interview problems](https://www.youtube.com/watch?v=S9LUYztYLu4) |
| 138 | +- [File handling](https://www.youtube.com/watch?v=b35mlSPOlJg) |
| 139 | +- [Trees](https://www.youtube.com/playlist?list=PL9gnSGHSqcnqfctdbCQKaw5oZ9Up2cmsq) |
| 140 | + - [Introduction](https://www.youtube.com/watch?v=4s1Tcvm00pA) |
| 141 | + - Binary Trees |
| 142 | + - Binary Search Trees |
| 143 | + - [Interview questions](https://www.youtube.com/watch?v=9D-vP-jcc-Y) |
| 144 | + - DFS |
| 145 | + - BFS |
| 146 | + - [AVL Trees](https://www.youtube.com/watch?v=CVA85JuJEn0) |
| 147 | + - [Segment Tree](https://www.youtube.com/watch?v=ciHThtTVNto) |
| 148 | + - Fenwick Tree / Binary Indexed Tree |
144 | 149 | - Heaps |
145 | 150 | - Introduction |
146 | 151 | - Theory |
|
188 | 193 | - Tries |
189 | 194 |
|
190 | 195 | ### Advanced concepts apart from interviews |
191 | | -- Fast IO |
192 | | -- File handling |
193 | 196 | - Bitwise + DP |
194 | 197 | - Extended Euclidean algorithm |
195 | 198 | - Modulo Multiplicative Inverse |
|
205 | 208 | - Euler Totient |
206 | 209 | - NP-Completeness |
207 | 210 | - Multithreading |
208 | | -- Fenwick Tree / Binary Indexed Tree |
209 | 211 | - Square Root Decomposition |
0 commit comments