Given an array of intervals, where each interval is represented as intervals[i] $= [l_i, r_i)$ (indicating the range from $l_i$ to $r_i$, inclusive of $l_i$ and exclusive of $r_i$), remove all intervals that are completely covered by another interval in the list. Return the count of intervals that remain after removing the covered ones.

Note: An interval $[a, b)$ is considered covered ...