From Special to General¶
Table of Contents¶
- 2745. Construct the Longest New String (Medium)
- 2611. Mice and Cheese (Medium)
- 1029. Two City Scheduling (Medium)
- 2645. Minimum Additions to Make Valid String (Medium)
- 2202. Maximize the Topmost Element After K Moves (Medium)
- 2568. Minimum Impossible OR (Medium)
- 1702. Maximum Binary String After Change (Medium)
- 3012. Minimize Length of Array Using Operations (Medium)
- 1526. Minimum Number of Increments on Subarrays to Form a Target Array (Hard)
- 2350. Shortest Impossible Sequence of Rolls (Hard)
- 517. Super Washing Machines (Hard)
- 2499. Minimum Total Cost to Make Arrays Unequal (Hard)
- 3357. Minimize the Maximum Adjacent Element Difference (Hard)