Added solutions by Saumya Agrahari

submissions/SaumyaAgrahari/question1/solution1.py

@@ -0,0 +1,9 @@
+class Solution:
+    def maxSubArray(self, nums):
+        max_sum = curr_sum = nums[0]
+
+        for i in range(1, len(nums)):
+            curr_sum = max(nums[i], curr_sum + nums[i])
+            max_sum = max(max_sum, curr_sum)
+
+        return max_sum   

submissions/SaumyaAgrahari/question2/solution2.py

@@ -0,0 +1,21 @@
+class Solution:
+    def sortedSquares(self, nums):
+        n = len(nums)
+        result = [0] * n
+        left, right = 0, n - 1
+        pos = n - 1 
+
+        while left <= right:
+            left_sq = nums[left] ** 2
+            right_sq = nums[right] ** 2
+
+            if left_sq > right_sq:
+                result[pos] = left_sq
+                left += 1
+            else:
+                result[pos] = right_sq
+                right -= 1
+            pos -= 1
+
+        return result
+