-
ref: https://ithelp.ithome.com.tw/users/20112376/ironman/2672
-
Day 1:
- [TODO] 509. fibonacci-number.cpp
- [TODO] 322. coin-change.cpp
-
Day 2:
- [TODO] 62. unique-paths.cpp
- [TODO] 5. longest-palindromic-substring.cpp
-
Day 3:
- [TODO] 96. unique-binary-search-trees.cpp
- [TODO] 70. climbing-stairs.cpp
- [TODO] 746. min-cost-climbing-stairs.cpp
-
Day 4:
- [TODO] leetcode/1143. longest-common-subsequence.cpp
-
Day 5:
- [TODO] leetcode/221. maximal-square.cpp
- leetcode/85. maximal-rectangle.cpp
-
Day 6:
- leetcode/97. interleaving-string.cpp
-
Day 7:
- leetcode/115. distinct-subsequences.cpp
- leetcode/72. edit-distance.cpp
- leetcode/516. longest-palindromic-subsequence.cpp
- leetcode/1092. shortest-common-supersequence.cpp
-
Day 8:
- leetcode/1000. minimum-cost-to-merge-stones.cpp
-
Day 9:
- [TODO] IOI 2004 - Phidias
-
Day 10:
- leetcode/309. best-time-to-buy-and-sell-stock-with-cooldown.cpp
-
Day 11:
- leetcode/474. ones-and-zeroes.cpp
- leetcode/903. valid-permutations-for-di-sequence.cpp
-
Day 12:
- leetcode/198. house-robber.cpp
- leetcode/213. house-robber-ii.cpp
- Scanline problems
- leetcode/252. meeting-rooms.cpp
- leetcode/253. meeting-rooms-ii.cpp
- leetcode/218. the-skyline-problem.cpp
- (4) 1447. simplified-fractions.cpp
- (7) 1449. form-largest-integer-with-digits-that-add-up-to-target.cpp
- (4) 1461. check-if-a-string-contains-all-binary-codes-of-size-k.cpp
- (5) 1462. course-schedule-iv.cpp
- (6) 1463. cherry-pickup-ii.cpp
- (4) 1476. subrectangle-queries.cpp
- (5) 1477. find-two-non-overlapping-sub-arrays-each-with-target-sum.cpp
- (7) 1478. allocate-mailboxes.cpp
- (3) 1507. reformat-date.cpp
- (4) 1508. range-sum-of-sorted-subarray-sums.cpp
- (5) 1509. minimum-difference-between-largest-and-smallest-value-in-three-moves.cpp
- (6) 1510. stone-game-iv.cpp
- (4) 1524. number-of-sub-arrays-with-odd-sum.cpp
- (7) 1526. minimum-number-of-increments-on-subarrays-to-form-a-target-array.cpp
- (3) 1539. kth-missing-positive-number.cpp
- (5) 1541. minimum-insertions-to-balance-a-parentheses-string.cpp
- (6) 1542. find-longest-awesome-substring.cpp
- (5) 1558. minimum-numbers-of-function-calls-to-make-target-array.cpp
- (6) 1559. detect-cycles-in-2d-grid.cpp
- (5) 1574. shortest-subarray-to-be-removed-to-make-array-sorted.cpp
- (6) 1575. count-all-possible-routes.cpp
- (5) 1589. maximum-sum-obtained-of-any-permutation.cpp
- (5) 1590. make-sum-divisible-by-p.cpp
- (6) 1591. strange-printer-ii.cpp
- Qualification Round
- (15) qa-leapfrog-ch1.cpp
- (15) qa-leapfrog-ch2.cpp
- (25) qc-mr.x.cpp
- (45) qd-trees-as-a-service.cpp
- Round 1