RunningSumOf1dArray

Author: sidparashar2001

Arrays/KidsWithTheGreatestNoOfCandies.cpp

@@ -0,0 +1,62 @@
+#include<bits/stdc++.h>
+using namespace std;
+// Approach 1
+// class Solution {
+// public:
+//     vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
+//         // Firstly let's calculate the max element in the array
+//         int max=*max_element(candies.begin(),candies.end());
+//         vector<bool> a;
+//         for (int i = 0; i < candies.size(); i++)
+//         {
+//             // If the no. of candies and extra candies is greater than equal to max then we will push_back true else false
+//             if(candies[i]+extraCandies>=max){
+//                 a.push_back(true);
+//             }
+//             else{
+//                 a.push_back(false);
+//             }
+//         }
+//         return a;
+        
+//     }
+// };
+// Approach 2
+class Solution {
+public:
+    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
+       int maxc=*max_element(candies.begin(),candies.end());
+       vector<bool> result;
+    //    auto will automatically define the data type
+    // x is the element of candies array that will be changed after every iteration of for loop
+       for(auto x:candies){
+           if(x+extraCandies>=maxc)
+           result.push_back(true);
+           else
+           result.push_back(false);
+       }
+        return result;
+    }
+};
+int main(){
+    int element,excandy;
+    Solution v;
+    vector<int> vc;
+    
+    for (int i = 0; i < 5; i++)
+    {
+        cin>>element;
+       vc.push_back(element);
+    }
+    cout<<"Size="<<vc.size()/2;
+    cout<<"\nEnter the extra candies:";
+    cin>>excandy;
+    vector<bool> v1=v.kidsWithCandies(vc,excandy);
+    cout<<"\nAfter running sum";
+    for (int i = 0; i < v1.size(); i++)
+    {
+        cout<<v1[i]<<",";
+    }
+    
+    return 0;
+}

Arrays/RunningSumOf1dArray.cpp

@@ -0,0 +1,47 @@
+/*Question:-
+Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]).
+
+Return the running sum of nums.
+
+ 
+
+Example 1:
+
+Input: nums = [1,2,3,4]
+Output: [1,3,6,10]
+Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].
+Example 2:
+
+Input: nums = [1,1,1,1,1]
+Output: [1,2,3,4,5]
+Explanation: Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1].
+Constraints:
+
+1 <= nums.length <= 1000
+-10^6 <= nums[i] <= 10^6
+*/
+#include<bits/stdc++.h>
+using namespace std;
+vector<int> runningSum(vector<int>& nums) {
+        for(int i=1;i<nums.size();i++){
+            nums[i]+=nums[i-1];
+        }
+        return nums;//returning the array
+    }
+int main(){
+vector<int> nums;//to store elements
+int n,element;
+cin>>n;
+ for (int i = 0; i < n; i++)
+    {
+        cin>>element;
+       nums.push_back(element);//storeing the elements
+    }
+vector<int> result=runningSum(nums);//calling the fuction to return the running sum of array
+for (int i = 0; i < result.size(); i++)
+{
+    cout<<result[i]<<",";//print the elements of running sum array
+}
+
+return 0;
+}