Intervals on Jeanphilo Bloghttps://shio-chan-dev.github.io/jeanblog/tags/intervals/Recent content in Intervals on Jeanphilo BlogHugo -- 0.165.0en-usMon, 06 Jul 2026 00:00:00 +0800LeetCode 435: Non-overlapping Intervals From Minimum Removals to Maximum Kepthttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/435-non-overlapping-intervals/Mon, 06 Jul 2026 00:00:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/435-non-overlapping-intervals/Solve LeetCode 435 in Python by turning minimum removals into maximum kept non-overlapping intervals, then deriving the earliest-ending interval greedy scan.LeetCode 452: Minimum Number of Arrows From Shared Intersections to Interval Greedyhttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/452-minimum-number-of-arrows-to-burst-balloons/Mon, 06 Jul 2026 00:00:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/452-minimum-number-of-arrows-to-burst-balloons/Solve LeetCode 452 in Python by deriving arrow coverage from shared interval intersections, then compressing the baseline into an earliest-ending arrow_pos greedy scan.