| 346 |
Minimum ASCII Delete Sum for Two Strings |
Medium |
StringDynamic Programming |
| 347 |
Minimum Changes to Make K Semi-palindromes |
Hard |
Two PointersStringDynamic Programming |
| 348 |
Minimum Cost for Cutting Cake I |
Medium |
ArrayTwo PointersDynamic Programming |
| 349 |
Minimum Cost For Tickets |
Medium |
ArrayDynamic Programming |
| 350 |
Minimum Cost Good Caption |
Hard |
StringDynamic Programming |
| 351 |
Minimum Cost to Change the Final Value of Expression |
Hard |
MathStringDynamic Programming |
| 352 |
Minimum Cost to Connect Two Groups of Points |
Hard |
ArrayDynamic ProgrammingBit Manipulation |
| 353 |
Minimum Cost to Convert String II |
Hard |
ArrayStringDynamic Programming |
| 354 |
Minimum Cost to Cut a Stick |
Hard |
ArrayDynamic ProgrammingSorting |
| 355 |
Minimum Cost to Divide Array Into Subarrays |
Hard |
ArrayDynamic ProgrammingPrefix Sum |
| 356 |
Minimum Cost to Make All Characters Equal |
Medium |
StringDynamic ProgrammingGreedy |
| 357 |
Minimum Cost to Merge Stones |
Hard |
ArrayDynamic ProgrammingPrefix Sum |
| 358 |
Minimum Cost to Reach Destination in Time |
Hard |
ArrayDynamic ProgrammingGraph |
| 359 |
Minimum Cost to Separate Sentence Into Rows |
Medium |
ArrayDynamic Programming |
| 360 |
Minimum Cost to Split an Array |
Hard |
ArrayHash TableDynamic Programming |