Search
⌘K

Leetcode 2848. Points That Intersect With Cars

Given a list of closed integer intervals [start, end], return the number of distinct integer points covered by the union of those intervals. This is essentially computing the size of the union of intervals (nums length ≤100, endpoints in [1,100]).


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Your account is free and you can post anonymously if you choose.