<h2><a href="https://leetcode.com/problems/points-that-intersect-with-cars/">2848. Points That Intersect With Cars</a></h2><h3>Easy</h3><hr><div><p>You are given a <strong>0-indexed</strong> 2D integer array <code>nums</code> representing the coordinates of the cars parking on a number line. For any index <code>i</code>, <code>nums[i] = [start_i, end_i]</code> where <code>start_i</code> is the starting point of the <code>i^th</code> car and <code>end_i</code> is the ending point of the <code>i^th</code> car.</p>

<p>Return <em>the number of integer points on the line that are covered with <strong>any part</strong> of a car.</em></p>

<p>&nbsp;</p>

<p><strong class="example">Example 1:</strong></p>

<pre><strong>Input:</strong> nums = [[3,6],[1,5],[4,7]]

<strong>Output:</strong> 7

<strong>Explanation:</strong> All the points from 1 to 7 intersect at least one car, therefore the answer would be 7.

</pre>

<p><strong class="example">Example 2:</strong></p>

<pre><strong>Input:</strong> nums = [[1,3],[5,8]]

<strong>Output:</strong> 7

<strong>Explanation:</strong> Points intersecting at least one car are 1, 2, 3, 5, 6, 7, 8. There are a total of 7 points, therefore the answer would be 7.

</pre>

<p>&nbsp;</p>

<p><strong>Constraints:</strong></p>

<ul>

<li><code>1 &lt;= nums.length &lt;= 100</code></li>

<li><code>nums[i].length == 2</code></li>

<li><code><font face="monospace">1 &lt;= start_i&nbsp;&lt;= end_i&nbsp;&lt;= 100</font></code></li>

</ul>

</div>