From 7eb382660bdeb6a4e80a6b208ef02f707e78e224 Mon Sep 17 00:00:00 2001
From: Jimit Dholakia <25223469+jimit105@users.noreply.github.com>
Date: Fri, 20 Dec 2024 07:16:45 +0000
Subject: [PATCH] Sync LeetCode submission Runtime - 3 ms (76.10%), Memory -
 21.6 MB (6.28%)

---
 0303-range-sum-query---immutable/README.md   | 39 ++++++++++++++++++++
 0303-range-sum-query---immutable/solution.py | 20 ++++++++++
 2 files changed, 59 insertions(+)
 create mode 100644 0303-range-sum-query---immutable/README.md
 create mode 100644 0303-range-sum-query---immutable/solution.py

diff --git a/0303-range-sum-query---immutable/README.md b/0303-range-sum-query---immutable/README.md
new file mode 100644
index 0000000..083bf97
--- /dev/null
+++ b/0303-range-sum-query---immutable/README.md
@@ -0,0 +1,39 @@
+<p>Given an integer array <code>nums</code>, handle multiple queries of the following type:</p>
+
+<ol>
+	<li>Calculate the <strong>sum</strong> of the elements of <code>nums</code> between indices <code>left</code> and <code>right</code> <strong>inclusive</strong> where <code>left &lt;= right</code>.</li>
+</ol>
+
+<p>Implement the <code>NumArray</code> class:</p>
+
+<ul>
+	<li><code>NumArray(int[] nums)</code> Initializes the object with the integer array <code>nums</code>.</li>
+	<li><code>int sumRange(int left, int right)</code> Returns the <strong>sum</strong> of the elements of <code>nums</code> between indices <code>left</code> and <code>right</code> <strong>inclusive</strong> (i.e. <code>nums[left] + nums[left + 1] + ... + nums[right]</code>).</li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input</strong>
+[&quot;NumArray&quot;, &quot;sumRange&quot;, &quot;sumRange&quot;, &quot;sumRange&quot;]
+[[[-2, 0, 3, -5, 2, -1]], [0, 2], [2, 5], [0, 5]]
+<strong>Output</strong>
+[null, 1, -1, -3]
+
+<strong>Explanation</strong>
+NumArray numArray = new NumArray([-2, 0, 3, -5, 2, -1]);
+numArray.sumRange(0, 2); // return (-2) + 0 + 3 = 1
+numArray.sumRange(2, 5); // return 3 + (-5) + 2 + (-1) = -1
+numArray.sumRange(0, 5); // return (-2) + 0 + 3 + (-5) + 2 + (-1) = -3
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
+	<li><code>-10<sup>5</sup> &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= left &lt;= right &lt; nums.length</code></li>
+	<li>At most <code>10<sup>4</sup></code> calls will be made to <code>sumRange</code>.</li>
+</ul>
diff --git a/0303-range-sum-query---immutable/solution.py b/0303-range-sum-query---immutable/solution.py
new file mode 100644
index 0000000..18d5e10
--- /dev/null
+++ b/0303-range-sum-query---immutable/solution.py
@@ -0,0 +1,20 @@
+# Approach 3: Prefix Sum
+
+# Time: O(1)
+# Space: O(n)
+
+class NumArray:
+
+    def __init__(self, nums: List[int]):
+        self.prefix_sum = [0] * (len(nums) + 1)
+        for i in range(len(nums)):
+            self.prefix_sum[i + 1] = self.prefix_sum[i] + nums[i]
+
+    def sumRange(self, left: int, right: int) -> int:
+        return self.prefix_sum[right + 1] - self.prefix_sum[left]
+        
+
+
+# Your NumArray object will be instantiated and called as such:
+# obj = NumArray(nums)
+# param_1 = obj.sumRange(left,right)