CPMagical CP Library

Problem solution · C++

Filter Occupied Intervals

Filter Occupied Intervals: a C++ solution using sorting and greedy selection. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Sorting and greedy selection
Source
Kamyu LeetCode Solutions
Length
43 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sorting and greedy selection

For Filter Occupied Intervals, the implementation first exposes a useful order, then scans that order while making locally justified choices.

  1. Choose the key that reveals the greedy or grouping structure.
  2. Sort the relevant records by that key.
  3. Scan in order, maintaining the invariant that makes each local choice safe.

Code notes

  • 43 lines of C++ from the credited upstream file filter-occupied-intervals.cpp.
  • The implementation visibly relies on sequence storage.
  • 2 loop blocks detected.

Complexity

Sorting is typically the dominant term unless the subsequent scan uses a more expensive nested operation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeFilter Occupied Intervals · C++C++
Use this to learn the idea, then write your own version.
// Time:  O(nlogn)// Space: O(n) // sortclass Solution {public:    vector<vector<int>> filterOccupiedIntervals(vector<vector<int>>& occupiedIntervals, int freeStart, int freeEnd) {        const auto& merged_intervals = [](auto& occupiedIntervals) {            ranges::sort(occupiedIntervals, [](const auto& a, const auto& b) {                return a[0] < b[0];            });            vector<vector<int>> result;            for (const auto& x : occupiedIntervals) {                if (empty(result) || result.back()[1] + 1 < x[0]) {                    result.emplace_back(x);                } else {                    result.back()[1] = max(result.back()[1], x[1]);                }            }            return result;        };            const auto& overlapped = [](const auto& a, const auto& b) {            return max(a[0], b[0]) <= min(a[1], b[1]);        };         vector<vector<int>> result;        for (const auto& x : merged_intervals(occupiedIntervals)) {            if (!overlapped(x, vector<int>{freeStart, freeEnd})) {                result.emplace_back(x);                continue;            }            if (x[0] <= freeStart - 1) {                result.push_back({x[0], freeStart - 1});            }            if (freeEnd + 1 <= x[1]) {                result.push_back({freeEnd + 1, x[1]});            }        }        return result;    }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗