LeetCode 3500. Minimum Cost to Divide Array Into Subarrays
biweekly contest 153。 應該算是初見殺，第一次碰到這種很難想出解法。
Recent posts
LeetCode 3499. Maximize Active Section with Trade I
biweekly contest 153。
LeetCode 3498. Reverse Degree of a String
biweekly contest 153。
LeetCode 3505. Minimum Operations to Make Elements Within K Subarrays Equal
weekly contest 443。 考點滿多的，劃分型 dp、中位數貪心、滑動窗口、對頂堆。
LeetCode 3504. Longest Palindrome After Substring Concatenation II
weekly contest 443。