Adds every code till 8th Jan '25

Author: PacemakerX

solutions_leetCode/1408_string-matching-in-an-array/README.md

@@ -0,0 +1,34 @@
+# String Matching in an Array
+
+**Question ID**: 1408 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 5 ms 
+**Memory**: 12 MB
+
+## Solution Code
+```cpp
+//https://leetcode.com/problems/string-matching-in-an-array
+class Solution {
+public:
+ vector<string> stringMatching(vector<string>& words) {
+
+  vector<string> ans;
+
+  for(auto i : words){
+  for(auto j:words){
+  if(i!=j){
+  if(j.find(i)!=string:: npos){
+  ans.push_back(i);
+  break;
+  }
+ }
+ }
+ }
+
+
+ return ans;
+ 
+ }
+};
+```

solutions_leetCode/1408_string-matching-in-an-array/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1501165727,
+ "question_id": 1408,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1738761555,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "5 ms",
+ "url": "https://leetcode.com/submissions/detail/1501165727/",
+ "is_pending": "Not Pending",
+ "title": "String Matching in an Array",
+ "memory": "12 MB",
+ "title_slug": "string-matching-in-an-array",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/1408_string-matching-in-an-array/solution.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+//https://leetcode.com/problems/string-matching-in-an-array
+class Solution {
+public:
+ vector<string> stringMatching(vector<string>& words) {
+
+ vector<string> ans;
+
+ for(auto i : words){
+ for(auto j:words){
+ if(i!=j){
+ if(j.find(i)!=string:: npos){
+ ans.push_back(i);
+ break;
+ }
+ }
+ }
+ }
+
+
+ return ans;
+ 
+ }
+};

solutions_leetCode/167_two-sum-ii-input-array-is-sorted/README.md

@@ -0,0 +1,36 @@
+# Two Sum II - Input Array Is Sorted
+
+**Question ID**: 167 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 0 ms 
+**Memory**: 19.41 MB
+
+## Solution Code
+```cpp
+//https://leetcode.com/problems/two-sum-ii---input-array-is-sorted
+class Solution
+{
+public:
+
+ vector<int> twoSum(vector<int> &numbers, int target)
+ {
+
+  vector<int> ans(2);
+  
+  int low=0,high=numbers.size()-1;
+
+  while(low<high){
+  int sum=numbers[low]+numbers[high];
+  if(sum==target)
+  return {++low,++high};
+  else if(sum>target){
+  high--;
+  }else
+  low++;
+  }
+
+  return {0,0};
+ }
+};
+```

solutions_leetCode/167_two-sum-ii-input-array-is-sorted/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1501978337,
+ "question_id": 167,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1738761686,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "0 ms",
+ "url": "https://leetcode.com/submissions/detail/1501978337/",
+ "is_pending": "Not Pending",
+ "title": "Two Sum II - Input Array Is Sorted",
+ "memory": "19.41 MB",
+ "title_slug": "two-sum-ii---input-array-is-sorted",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/167_two-sum-ii-input-array-is-sorted/solution.cpp

@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+//https://leetcode.com/problems/two-sum-ii---input-array-is-sorted
+
+class Solution
+{
+public:
+
+ vector<int> twoSum(vector<int> &numbers, int target)
+ {
+
+ vector<int> ans(2);
+ 
+ int low=0,high=numbers.size()-1;
+
+ while(low<high){
+ int sum=numbers[low]+numbers[high];
+ if(sum==target)
+ return {++low,++high};
+ else if(sum>target){
+ high--;
+ }else
+ low++;
+ }
+
+ return {0,0};
+ }
+};

solutions_leetCode/1769_minimum-number-of-operations-to-move-all-balls-to-each-box/README.md

@@ -0,0 +1,45 @@
+# Minimum Number of Operations to Move All Balls to Each Box
+
+**Question ID**: 1769 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 148 ms 
+**Memory**: 14.5 MB
+
+## Solution Code
+```cpp
+//https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box
+class Solution {
+public:
+ vector<int> minOperations(string boxes)
+ {
+ set<int> s;
+ vector<int> ans;
+ for (int i = 0; i < boxes.size(); i++)
+ {
+ if (boxes[i] == '1')
+ {
+
+  s.insert(i);
+  }
+ }
+
+ for (int i = 0; i < boxes.size(); i++)
+ {
+  int sum = 0;
+
+  for (auto it : s)
+  {
+  if (it == i)
+  continue;
+
+  sum += (abs(i-it));
+  }
+
+  ans.push_back(sum);
+  }
+
+  return ans;
+ }
+};
+```

solutions_leetCode/1769_minimum-number-of-operations-to-move-all-balls-to-each-box/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1499380439,
+ "question_id": 1769,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1738761440,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "148 ms",
+ "url": "https://leetcode.com/submissions/detail/1499380439/",
+ "is_pending": "Not Pending",
+ "title": "Minimum Number of Operations to Move All Balls to Each Box",
+ "memory": "14.5 MB",
+ "title_slug": "minimum-number-of-operations-to-move-all-balls-to-each-box",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/1769_minimum-number-of-operations-to-move-all-balls-to-each-box/solution.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+//https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box
+class Solution {
+public:
+ vector<int> minOperations(string boxes)
+ {
+ set<int> s;
+ vector<int> ans;
+ for (int i = 0; i < boxes.size(); i++)
+ {
+ if (boxes[i] == '1')
+ {
+
+ s.insert(i);
+ }
+ }
+
+ for (int i = 0; i < boxes.size(); i++)
+ {
+ int sum = 0;
+
+ for (auto it : s)
+ {
+ if (it == i)
+ continue;
+
+ sum += (abs(i-it));
+ }
+
+ ans.push_back(sum);
+ }
+
+ return ans;
+ }
+};
+

solutions_leetCode/209_minimum-size-subarray-sum/README.md

@@ -0,0 +1,48 @@
+# Minimum Size Subarray Sum
+
+**Question ID**: 209 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 0 ms 
+**Memory**: 32.29 MB
+
+## Solution Code
+```cpp
+//https://leetcode.com/problems/minimum-size-subarray-sum
+class Solution
+{
+public:
+ bool check(int num, vector<int> &nums, int target)
+ {
+ for (int i = 0; i + num - 1 < nums.size(); i++)
+ {
+ int sum = nums[i + num - 1] - (i > 0 ? nums[i - 1] : 0);
+ if (sum >= target)
+ return true;
+ }
+
+  return false;
+ }
+ int minSubArrayLen(int target, vector<int> &nums)
+ {
+  for (int i = 1; i < nums.size(); i++)
+  nums[i] += nums[i - 1];
+
+  int low = 1, high = nums.size(), ans = 0, mid;
+
+  while (low <= high)
+  {
+  mid = low + (high - low) / 2;
+  if (check(mid, nums, target))
+  {
+  ans = mid;
+  high = mid - 1;
+  }
+  else
+  low = mid + 1;
+  }
+
+  return ans;
+ }
+};
+```