Dynamic Programming
Problem ID | Title | Solution by | Most Popular Input by |
---|---|---|---|
105 | Easy Sequence 1 |
![]() |
|
109 | Easy Sequence 2 | ||
132 | The Game of Rocks | ||
136 | Gaaner Koli | ||
149 | The Perfect Collection | ||
170 | Sticking Pins | ||
176 | Smart Feature Phone 2 | ||
180 | Perseus and the New Challenge | ||
247 | Pathetic Interview II | ||
255 | Burger King | ||
261 | Harry Potter and the Vault of Gringotts | ||
318 | Alice in Candyland | ||
330 | Subarray Sum | ||
332 | LIDS |
![]() |
|
38 | Polygon Construction (Hard) | ||
380 | Maximum Sum | ||
381 | Very Dirty String | ||
387 | Orchid Division | ||
411 | Counting Murgis | ||
75 | Third Dimension | ||
92 | No GCD |
![]() |
|
99 | OCD Returns! |