File tree 1 file changed +11
-11
lines changed
1 file changed +11
-11
lines changed Original file line number Diff line number Diff line change 133
133
- Pop efficient
134
134
- Queue using Stack and Vice versa
135
135
- Circular Queue
136
- - Dynamic Programming
137
- - Introduction
138
- - Recursion + Recursion DP + Iteration + Iteration Space Optimized
139
- - Complexity Analysis
140
- - 0/1 Knapsack
141
- - Subset Questions
142
- - Unbounded Knapsack
143
- - Subsequence questions
144
- - String DP
145
136
- Trees
146
137
- Introduction
147
138
- Binary Trees
173
164
- Huffman-Encoder
174
165
- Top K elements problems
175
166
- Subarray Questions: Sliding window, Two Pointer, Kadane's Algorithm
176
- - Greedy Algorithms
177
- - Tries
178
167
- Graphs
179
168
- Introduction
180
169
- BFS
187
176
- Topological Sort
188
177
- Bellman ford
189
178
- A* pathfinding Algorithm
179
+ - Dynamic Programming
180
+ - Introduction
181
+ - Recursion + Recursion DP + Iteration + Iteration Space Optimized
182
+ - Complexity Analysis
183
+ - 0/1 Knapsack
184
+ - Subset Questions
185
+ - Unbounded Knapsack
186
+ - Subsequence questions
187
+ - String DP
188
+ - Greedy Algorithms
189
+ - Tries
190
190
191
191
### Advanced concepts apart from interviews
192
192
- Fast IO
You can’t perform that action at this time.
0 commit comments