LeetCode 3510. Minimum Pair Removal to Sort Array II
weekly contest 444。
Recent posts
LeetCode 3509. Maximum Product of Subsequences With an Alternating Sum Equal to K
weekly contest 444。 複雜度也很怪的題，還真沒想到怎麼做。
LeetCode 3508. Implement Router
weekly contest 444。
LeetCode 3507. Minimum Pair Removal to Sort Array I
weekly contest 444。
LeetCode 3500. Minimum Cost to Divide Array Into Subarrays
biweekly contest 153。 應該算是初見殺，第一次碰到這種很難想出解法。