LeetCode 🔴 295. Find Median from Data Stream (Old)
Problem solving record for LeetCode 295. Find Median from Data Stream.
LeetCode 🔴 295. Find Median from Data Stream
設計支援動態插入與查詢中位數的資料結構。用對頂堆把資料流切成較小與較大兩半，使插入為 O(log n)，查詢中位數為 O(1)。
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.
