Added CP handbook

C++/Maximum_Subarray_Sum.cpp

@@ -3,7 +3,15 @@
 #include <vector>
 
 using namespace std;
+int maxSubarraySum(vector<int> nums, int n){
+    int best = 0, sum = 0;
+    for(int i = 0; i < n; i++) {
+        sum = max(nums[i], sum + nums[i]);
+        best = max(best, sum);
+    }
+    return best;
 
+}
 int main() {
     int n;
     cin >> n;
@@ -12,13 +20,8 @@ int main() {
     for(int i = 0; i < n; i++)
         cin >> nums[i];
 
-    int best = 0, sum = 0;
-    for(int i = 0; i < n; i++) {
-        sum = max(nums[i], sum + nums[i]);
-        best = max(best, sum);
-    }
-
+    int best =maxSubarraySum(nums,n);
     cout << best << endl;
 
     return 0;
-}
+}

C++/Program to reverse number.cpp

@@ -1,5 +1,6 @@
 #include <iostream>  
 using namespace std;  
+//reverse function
 int reverseNum(int n){
 int reverse=0,rem;
   while(n!=0)