Adds some solutions and fixes a naming issue

Author: PacemakerX

solutions_leetCode/2640_maximum-number-of-integers-to-choose-from-a-range-i/README.md renamed to solutions_leetCode/2554_maximum-number-of-integers-to-choose-from-a-range-i/README.md

@@ -0,0 +1,31 @@
+# Find the Score of All Prefixes of an Array
+
+**Question ID**: 2640 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 0 ms 
+**Memory**: 58.91 MB
+
+## Solution Code
+```cpp
+//https://leetcode.com/problems/find-the-score-of-all-prefixes-of-an-array/
+class Solution {
+public:
+ vector<long long> findPrefixScore(vector<int>& nums) {
+ int currMax = nums[0];
+ vector<long long> ans(nums.size());
+
+  for (int i = 0; i < nums.size(); i++)
+  {
+  currMax = max(currMax, nums[i]);
+
+  ans[i] = nums[i] + currMax;
+
+  if (i)
+  ans[i] += ans[i - 1];
+  }
+
+ return ans;
+ }
+};
+```

solutions_leetCode/2640_maximum-number-of-integers-to-choose-from-a-range-i/metadata.json renamed to solutions_leetCode/2554_maximum-number-of-integers-to-choose-from-a-range-i/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1478720447,
+ "question_id": 2640,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1734195610,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "0 ms",
+ "url": "https://leetcode.com/submissions/detail/1478720447/",
+ "is_pending": "Not Pending",
+ "title": "Find the Score of All Prefixes of an Array",
+ "memory": "58.91 MB",
+ "title_slug": "find-the-score-of-all-prefixes-of-an-array",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/2640_maximum-number-of-integers-to-choose-from-a-range-i/solution.cpp renamed to solutions_leetCode/2554_maximum-number-of-integers-to-choose-from-a-range-i/solution.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+//https://leetcode.com/problems/find-the-score-of-all-prefixes-of-an-array/
+class Solution
+{
+public:
+ vector<long long> findPrefixScore(vector<int> &nums)
+ {
+ int currMax = nums[0];
+ vector<long long> ans(nums.size());
+
+ for (int i = 0; i < nums.size(); i++)
+ {
+ currMax = max(currMax, nums[i]);
+
+ ans[i] = nums[i] + currMax;
+
+ if (i)
+ ans[i] += ans[i - 1];
+ }
+
+ return ans;
+ }
+};

solutions_leetCode/2640_find-the-score-of-all-prefixes-of-an-array/README.md

@@ -0,0 +1,63 @@
+# Continuous Subarrays
+
+**Question ID**: 2762 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 92 ms 
+**Memory**: 111.86 MB 
+
+## Solution Code
+```cpp
+// https://leetcode.com/problems/continuous-subarrays
+class Solution {
+public:
+ long long continuousSubarrays(vector<int> &nums)
+ {
+
+  int lo = 0, hi = 0;
+
+  int n = nums.size();
+  int currMax = nums[0], currMin = nums[0];
+
+  long long count = 0,len;
+
+  for (hi = 0; hi < n; hi++)
+  {
+  currMax = max(currMax, nums[hi]);
+  currMin = min(currMin, nums[hi]);
+
+  if (currMax - currMin > 2)
+  {
+
+  len = hi - lo;
+
+  count += (len * (len + 1) / 2);
+
+  currMax = currMin = nums[hi];
+
+  lo = hi;
+
+  while (lo > 0 && abs(nums[hi] - nums[lo-1]) <= 2)
+  {
+  lo--;
+  currMax = max(currMax, nums[lo]);
+  currMin = min(currMin, nums[lo]);
+  }
+
+ if (lo < hi)
+ {
+  len = hi - lo;
+
+  count -= (len * (len + 1) / 2);
+  }
+  }
+  }
+  len = hi - lo;
+
+  count += (len * (len + 1) / 2);
+
+  return count;
+  
+ }
+};
+```

solutions_leetCode/2640_find-the-score-of-all-prefixes-of-an-array/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1478711307,
+ "question_id": 2762,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1734193894,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "92 ms",
+ "url": "/submissions/detail/1478711307/",
+ "is_pending": "Not Pending",
+ "title": "Continuous Subarrays",
+ "memory": "111.86 MB",
+ "title_slug": "continuous-subarrays",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/2640_find-the-score-of-all-prefixes-of-an-array/solution.cpp

@@ -0,0 +1,65 @@
+#include <bits/stdc++.h>
+using namespace std;
+// https://leetcode.com/problems/continuous-subarrays
+class Solution
+{
+public:
+ long long continuousSubarrays(vector<int> &nums)
+ {
+
+ int lo = 0, hi = 0;
+
+ int n = nums.size();
+ int currMax = nums[0], currMin = nums[0], len;
+
+ long long count = 0;
+
+ for (hi = 0; hi < n; hi++)
+ {
+ currMax = max(currMax, nums[hi]);
+ currMin = min(currMin, nums[hi]);
+
+ if (currMax - currMin > 2)
+ {
+
+ len = hi - lo;
+
+ count += (len * (len + 1) / 2);
+
+ currMax = currMin = nums[hi];
+
+ lo = hi;
+
+ while (lo > 0 && abs(nums[hi] - nums[lo]) <= 2)
+ {
+ lo--;
+ currMax = max(currMax, nums[lo]);
+ currMin = min(currMin, nums[lo]);
+ }
+
+ if (left < right)
+ {
+ len = hi - lo;
+
+ count -= (len * (len + 1) / 2);
+ }
+ }
+ }
+ len = hi - lo;
+
+ count += (len * (len + 1) / 2);
+
+ return count;
+ 
+ }
+};
+
+int main()
+{
+ Solution obj;
+
+ vector<int> a = {5, 4, 2, 4};
+
+ obj.continuousSubarrays(a);
+ return 0;
+}