Merge pull request kothariji#513 from wali39/master

add (LEETCODE) 53, 125, 209 problems solution

Author: kothariji

Arrays/(LEETCODE)_209_Minimum_size_Subarray_sum.cpp

@@ -0,0 +1,27 @@
+class Solution {
+public:
+    int minSubArrayLen(int target, vector<int>& nums) {
+        int i,s=nums.size();
+        int start=0;
+        int sum=0;
+        int result=INT_MAX;
+        int k=0;
+        int initialSum=0;
+        while(k<s){
+            initialSum+=nums[k];
+            k++;
+        }
+        if(initialSum<target){
+            return 0;
+        }
+        for(i=0; i<s; i++){
+            sum+=nums[i];
+            while(sum>=target){
+                result=min(result,i-start+1);
+                sum-=nums[start];
+                start++;
+            }
+        }
+        return result;
+    }
+};

Arrays/(LEETCODE)_53_Maximun_Subarray.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    int maxSubArray(vector<int>& nums) {
+        
+        int result=nums[0] ;
+        int maxEnd=nums[0];
+        for(int i=1; i<nums.size(); i++)
+        {
+            maxEnd=max(maxEnd+nums[i],nums[i]);
+            
+            result=max(result,maxEnd);
+        }
+        return result;
+    }
+};

String/(LEETCODE)_125_Valid_Palindrome.cpp

@@ -0,0 +1,45 @@
+
+class Solution
+{
+public:
+    bool isPalindrome(string s)
+    {
+
+        int i, j;
+        int n = s.size();
+
+        string minimizedSt = "";
+        //remove extra character
+        for (i = 0; i < n; i++)
+        {
+
+            if (s[i] == ' ')
+                continue;
+
+            if (s[i] >= 48 && s[i] <= 57)
+            {
+                minimizedSt.push_back(s[i]);
+            }
+
+            else if ((tolower(s[i]) >= 97 && tolower(s[i]) <= 122))
+            {
+                minimizedSt.push_back(tolower(s[i]));
+            }
+        }
+
+        string reverseSt = "";
+        string mainCopy = minimizedSt;
+
+        //reverse string part
+        for (j = mainCopy.size() - 1; j >= 0; j--)
+        {
+            reverseSt.push_back(mainCopy[j]);
+        }
+        if (minimizedSt == reverseSt)
+        {
+            return true;
+        }
+
+        return false;
+    }
+};