https://h30306.github.io/blog/tags/sweep-line/Recent content in Sweep-Line onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungThu, 15 Oct 2026 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-253/Thu, 15 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-253/LeetCode 253 note: a heap of end times for running meetings; half-open intervals need <=https://h30306.github.io/blog/leetcode/leetcode-759/Sun, 03 May 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-759/LeetCode 759 note: k-way merge all work intervals by start; any gap after the latest end so far is common free timehttps://h30306.github.io/blog/leetcode/leetcode-986/Sun, 01 Feb 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-986/LeetCode 986 note: two pointers each hold an interval, the intersection is [max(starts), min(ends)], and the interval that ends first cannot meet anything else, so its pointer advances