|
185 | 185 |
|
186 | 186 | ## 15. Dynamic Programming
|
187 | 187 |
|
188 |
| -|Problem|Difficulty|Solution| |
189 |
| -|------|--------|------| |
190 |
| -[]()|Medium|[Solution](https://github.com/kiranpalsingh1806/awesome-dsa/blob/master/SOLUTIONS.md)| |
| 188 | +|S.No|Problem|Difficulty|Solution| |
| 189 | +|-|------|--------|------| |
| 190 | +|1|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)|Easy|[Solution](/solutions/dp.md)| |
| 191 | +|2|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)|Easy|[Solution](/solutions/dp.md)| |
| 192 | +|3|[Best Time To Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)|Easy|[Solution](/solutions/dp.md)| |
| 193 | +|4|[Jump Game](https://leetcode.com/problems/jump-game/)|Medium|[Solution](/solutions/dp.md)| |
| 194 | +|5|[Unique Paths](https://leetcode.com/problems/unique-paths/)|Medium|[Solution](/solutions/dp.md)| |
| 195 | +|6|[Decode Ways](https://leetcode.com/problems/decode-ways/)|Medium|[Solution](/solutions/dp.md)| |
| 196 | +|7|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)|Medium|[Solution](/solutions/dp.md)| |
| 197 | +|8|[House Robber](https://leetcode.com/problems/house-robber/)|Medium|[Solution](/solutions/dp.md)| |
| 198 | +|9|[Word Break](https://leetcode.com/problems/word-break/)|Medium|[Solution](/solutions/dp.md)| |
| 199 | +|10|[Coin Change](https://leetcode.com/problems/coin-change/)|Medium|[Solution](/solutions/dp.md)| |
| 200 | + |
| 201 | + |
191 | 202 |
|
192 | 203 | ## 16. Euler Circuit
|
193 | 204 |
|
|
246 | 257 |
|
247 | 258 | ## 25. Kruskal Algorithm
|
248 | 259 |
|
249 |
| -|Problem|Difficulty|Solution| |
250 |
| -|------|--------|------| |
251 |
| -[]()|Medium|[Solution](https://github.com/kiranpalsingh1806/awesome-dsa/blob/master/SOLUTIONS.md)| |
| 260 | +|S.No|Problem|Difficulty|Solution| |
| 261 | +|-|------|--------|------| |
| 262 | +|1|[Min Cost To Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points/)|Medium|[Solution](/solutions/kruskal.md)| |
| 263 | +|2|[Find Critical And Pseudo Critical Edges in Minimum Spanning Tree](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/)|Medium|[Solution](/solutions/kruskal.md)| |
252 | 264 |
|
253 | 265 | ## 26. Line Sweep
|
254 | 266 |
|
|
0 commit comments