LeetCode

將問題轉換為完全圖的邊斷開過程，任何拆分方式的總代價均恆為 n(n-1)/2。

Problem solving record for LeetCode Weekly Contest 491.

Problem solving record for LeetCode Weekly Contest 492.

Problem solving record for LeetCode 3202. Find the Maximum Length of Valid Subsequence II.

Problem solving record for LeetCode Biweekly Contest 154. Rank 169.

Problem solving record for LeetCode 368. Largest Divisible Subset.

Problem solving record for LeetCode 2874. Maximum Value of an Ordered Triplet II.

A collection of LeetCode 2025/04 daily challenge.

Problem solving record for LeetCode 2127. Maximum Employees to Be Invited to a Meeting.

Problem solving record for LeetCode 1286. Iterator for Combination.

Problem solving record for LeetCode 295. Find Median from Data Stream.

設計支援動態插入與查詢中位數的資料結構。用對頂堆把資料流切成較小與較大兩半，使插入為 O(log n)，查詢中位數為 O(1)。

Problem solving record for LeetCode 53. Maximum Subarray.

Problem solving record for LeetCode 31. Next Permutation.

給定正整數陣列，求最大子集大小使其中所有元素的位元 AND 大於 0。關鍵在於枚舉每個位元，統計該位元為 1 的元素個數。