Harsh Jaiswal·Sep 26🚀 Greedy Algorithms: Interval Scheduling & Overlapping IntervalsWhile learning Greedy Algorithms, I came across a pattern that was new for me: Intervals.
Olumide D. Fakorede·Jul 16, 2025How I Solved a Complex Scheduling Problem (And What I Learned About Algorithms)A journey from O(n³) nightmare to millisecond magic
餘生·Jul 20, 2023435. Non-overlapping Intervals原本想說用greedy的思路去解題，如果intervals[i][0]小於前一個區間的終點就加一，但反例[[1,4],[2,5],[4,6]]證明是行不通。後來才發現我忽略了一個重要的點，並非要小於前一個區間的終點，而是要小於前一個未被移除區間的終點。
