Sync LeetCode submission Runtime - 7 ms (34.82%), Memory - 17.8 MB (6.29%)

Author: jimit105

3034-points-that-intersect-with-cars/README.md

@@ -0,0 +1,29 @@
+<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<sub>i</sub>, end<sub>i</sub>]</code> where <code>start<sub>i</sub></code> is the starting point of the <code>i<sup>th</sup></code> car and <code>end<sub>i</sub></code> is the ending point of the <code>i<sup>th</sup></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<sub>i</sub>&nbsp;&lt;= end<sub>i</sub>&nbsp;&lt;= 100</font></code></li>
+</ul>

3034-points-that-intersect-with-cars/solution.py

@@ -0,0 +1,12 @@
+# Time: O(n * m), n = no. of cars, m = max range of any car
+# Space: O(p), p = unique points covered by all cars
+
+class Solution:
+    def numberOfPoints(self, nums: List[List[int]]) -> int:
+        covered_points = set()
+
+        for start, end in nums:
+            for point in range(start, end + 1):
+                covered_points.add(point)
+
+        return len(covered_points)