Adds questions till 5th Jan

Author: PacemakerX

solutions_leetCode/1422_maximum-score-after-splitting-a-string/README.md

@@ -0,0 +1,39 @@
+# Maximum Score After Splitting a String
+
+**Question ID**: 1422 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 0 ms 
+**Memory**: 8.9 MB
+
+## Solution Code
+```cpp
+//https://leetcode.com/problems/maximum-score-after-splitting-a-string
+class Solution {
+public:
+ int maxScore(string s) {
+
+  int zero=0,one=0;
+
+  for(auto ch : s)
+  if(ch=='0') zero++;
+  else one++;
+
+  int ans=0;
+  
+  int cntZero=0,cntOne=0;
+
+  for(int i=0;i<s.size()-1;i++){
+  char ch=s[i];
+  if(ch=='0'){
+  ans=max(ans,++cntZero+(one-cntOne));
+  }else{
+
+  ans=max(ans,cntZero+(one- (++cntOne)));
+  }
+ }
+ 
+ return ans;
+ }
+};
+```

solutions_leetCode/1422_maximum-score-after-splitting-a-string/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1493792171,
+ "question_id": 1422,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1738760487,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "0 ms",
+ "url": "https://leetcode.com/submissions/detail/1493792171/",
+ "is_pending": "Not Pending",
+ "title": "Maximum Score After Splitting a String",
+ "memory": "8.9 MB",
+ "title_slug": "maximum-score-after-splitting-a-string",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/1422_maximum-score-after-splitting-a-string/solution.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// https://leetcode.com/problems/maximum-score-after-splitting-a-string
+
+class Solution
+{
+public:
+ int maxScore(string s)
+ {
+
+ int zero = 0, one = 0;
+
+ for (auto ch : s)
+ if (ch == '0')
+ zero++;
+ else
+ one++;
+
+ int ans = 0;
+
+ int cntZero = 0, cntOne = 0;
+
+ for (int i = 0; i < s.size() - 1; i++)
+ {
+ char ch = s[i];
+ if (ch == '0')
+ {
+ ans = max(ans, ++cntZero + (one - cntOne));
+ }
+ else
+ {
+
+ ans = max(ans, cntZero + (one - (++cntOne)));
+ }
+ }
+
+ return ans;
+ }
+};

solutions_leetCode/1930_unique-length-3-palindromic-subsequences/README.md

@@ -0,0 +1,46 @@
+# Unique Length-3 Palindromic Subsequences
+
+**Question ID**: 1930 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 177 ms 
+**Memory**: 15.98 MB
+
+## Solution Code
+```cpp
+//https://leetcode.com/problems/unique-length-3-palindromic-subsequences
+class Solution {
+public:
+ int countPalindromicSubsequence(string s) {
+ unordered_set<char> letters;
+ for (char c : s) {
+ letters.insert(c);
+ }
+ 
+ int ans = 0;
+ for (char letter : letters) {
+ int i = -1;
+ int j = 0;
+ 
+ for (int k = 0; k < s.size(); k++) {
+ if (s[k] == letter) {
+ if (i == -1) {
+ i = k;
+ }
+ 
+ j = k;
+ }
+ }
+ 
+ unordered_set<char> between;
+ for (int k = i + 1; k < j; k++) {
+ between.insert(s[k]);
+ }
+ 
+ ans += between.size();
+ }
+ 
+ return ans;
+ }
+};
+```

solutions_leetCode/1930_unique-length-3-palindromic-subsequences/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1497730140,
+ "question_id": 1930,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1738761016,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "177 ms",
+ "url": "https://leetcode.com/submissions/detail/1497730140/",
+ "is_pending": "Not Pending",
+ "title": "Unique Length-3 Palindromic Subsequences",
+ "memory": "15.98 MB",
+ "title_slug": "unique-length-3-palindromic-subsequences",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/1930_unique-length-3-palindromic-subsequences/solution.cpp

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+//https://leetcode.com/problems/unique-length-3-palindromic-subsequences
+
+class Solution {
+public:
+ int countPalindromicSubsequence(string s) {
+ unordered_set<char> letters;
+ for (char c : s) {
+ letters.insert(c);
+ }
+ 
+ int ans = 0;
+ for (char letter : letters) {
+ int i = -1;
+ int j = 0;
+ 
+ for (int k = 0; k < s.size(); k++) {
+ if (s[k] == letter) {
+ if (i == -1) {
+ i = k;
+ }
+ 
+ j = k;
+ }
+ }
+ 
+ unordered_set<char> between;
+ for (int k = i + 1; k < j; k++) {
+ between.insert(s[k]);
+ }
+ 
+ ans += between.size();
+ }
+ 
+ return ans;
+ }
+};

solutions_leetCode/2270_number-of-ways-to-split-array/README.md

@@ -0,0 +1,39 @@
+# Number of Ways to Split Array
+
+**Question ID**: 2270 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 0 ms 
+**Memory**: 104.08 MB
+
+## Solution Code
+```cpp
+//https://leetcode.com/problems/number-of-ways-to-split-array
+class Solution {
+public:
+ int waysToSplitArray(vector<int>& nums) {
+
+ int n=nums.size();
+  vector<long long> prefix(n),suffix(n);
+
+  prefix[0]=nums[0];
+  suffix[n-1]=nums[n-1];
+
+  for(int i=1;i<n;i++){
+  prefix[i]+=prefix[i-1]+nums[i];
+  } 
+
+  for(int i=n-2;i>=0;i--){
+  suffix[i]+=suffix[i+1]+nums[i];
+  }
+ int cnt=0;
+
+ for(int i=0;i<n-1;i++){
+  if(prefix[i]>=suffix[i+1])
+  cnt++;
+  }
+
+  return cnt;
+ }
+};
+```

solutions_leetCode/2270_number-of-ways-to-split-array/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1496654976,
+ "question_id": 2270,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1738760839,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "0 ms",
+ "url": "https://leetcode.com/submissions/detail/1496654976/",
+ "is_pending": "Not Pending",
+ "title": "Number of Ways to Split Array",
+ "memory": "104.08 MB",
+ "title_slug": "number-of-ways-to-split-array",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/2270_number-of-ways-to-split-array/solution.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+//https://leetcode.com/problems/number-of-ways-to-split-array
+
+class Solution {
+public:
+ int waysToSplitArray(vector<int>& nums) {
+
+ int n=nums.size();
+ vector<long long> prefix(n),suffix(n);
+
+ prefix[0]=nums[0];
+ suffix[n-1]=nums[n-1];
+
+ for(int i=1;i<n;i++){
+ prefix[i]+=prefix[i-1]+nums[i];
+ } 
+
+ for(int i=n-2;i>=0;i--){
+ suffix[i]+=suffix[i+1]+nums[i];
+ }
+ int cnt=0;
+
+ for(int i=0;i<n-1;i++){
+ if(prefix[i]>=suffix[i+1])
+ cnt++;
+ }
+
+ return cnt;
+ }
+};

solutions_leetCode/2381_shifting-letters-ii/README.md

@@ -0,0 +1,46 @@
+# Shifting Letters II
+
+**Question ID**: 2381 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 49 ms 
+**Memory**: 108.32 MB
+
+## Solution Code
+```cpp
+//https://leetcode.com/problems/shifting-letters-ii
+class Solution {
+public:
+ string shiftingLetters(string s, vector<vector<int>> &shifts)
+ {
+ vector<int> arr;
+
+  arr.resize(s.size(), 0);
+
+  for (auto i : shifts)
+  {
+  int start = i[0];
+  int end = i[1];
+  int dir = i[2] == 1 ? 1 : -1;
+
+  arr[start] += dir;
+  if (end < arr.size() - 1)
+  arr[end + 1] += -dir;
+  }
+
+ for (int i = 1; i < arr.size(); i++)
+ {
+  arr[i] += arr[i - 1];
+  }
+
+  for (int i = 0; i < s.size(); i++)
+  {
+  char ch = s[i];
+  int netShift = (arr[i] % 26 + 26) % 26;
+  s[i] = (char)('a' + (s[i] - 'a' + netShift + 26) % 26);
+  }
+
+  return s;
+ }
+};
+```