LeetCode 🟡 53. Maximum Subarray
Problem solving record for LeetCode 53. Maximum Subarray.
LeetCode 🟡 31. Next Permutation
Problem solving record for LeetCode 31. Next Permutation.
LeetCode 🔴 1671. Minimum Number of Removals to Make Mountain Array
Problem solving record for LeetCode 1671. Minimum Number of Removals to Make Mountain Array.
LeetCode - 300. Longest Increasing Subsequence (LIS)
紀錄了時間複雜度從 O(n^2) 到 O(nlogn) 的三種解法，並在題目要求外，額外添加了還原 LIS 的過程。
