https://h30306.github.io/blog/tags/ordered-set/Recent content in Ordered-Set onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungSun, 26 Jul 2026 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-2382/Sun, 26 Jul 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2382/LeetCode 2382 note: work backward so removals become additions; the Union-Find root stores the segment sum, and the maximum only growshttps://h30306.github.io/blog/leetcode/leetcode-220/Sat, 10 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-220/LeetCode 220 note: with bucket size valueDiff + 1, two numbers in one bucket always qualify, so only the two neighboring buckets need checking; the window keeps the latest indexDiff numbers, so each bucket holds at most one