Skip to content

Commit 21915f6

Browse files
Add new topics and problems
1 parent 1e891c5 commit 21915f6

File tree

5 files changed

+18
-6
lines changed

5 files changed

+18
-6
lines changed

README.md

+18-6
Original file line numberDiff line numberDiff line change
@@ -185,9 +185,20 @@
185185

186186
## 15. Dynamic Programming
187187

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+
191202

192203
## 16. Euler Circuit
193204

@@ -246,9 +257,10 @@
246257

247258
## 25. Kruskal Algorithm
248259

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)|
252264

253265
## 26. Line Sweep
254266

File renamed without changes.
File renamed without changes.

solutions/dp.md

Whitespace-only changes.

solutions/kruskal.md

Whitespace-only changes.

0 commit comments

Comments
 (0)