DSA
Three approaches — Math formula O(n), Greedy Max-Heap O(n log k), Sorted Array O(n). Find minimum CPU intervals with cooldown constraint.
Covers: Greedy, optimized Greedy with DSU, Dp. Optimal — Time O(nlogn), Space O(m).
Intervals problem — solution with code and analysis.
Covers: Sweep line algorithm (or tim…, Min Heap (Priority Queue), Two Sorted Arrays (Two Point…. Optimal — Time O(n log n), Space O(n).
Intervals. Time O(N * logN), Space O(N).
Covers: Recursion, Greedy. Optimal — Time O(n), Space O(1).
Greedy. Time O(n), Space O(n).
Covers: Recursive, DP, Greedy. Optimal — Time O(n), Space O(1).