Add files via upload

Author: ankurmoh

LC_1.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+        unordered_map<int,int>mp;
+        vector<int>v;
+        int i,len=nums.size();
+        for(i=0;i<len;i++)
+        {
+            if(mp.find(target-nums[i])!=mp.end())
+            {
+                v.push_back(mp[target-nums[i]]);
+                v.push_back(i);
+                return v;
+            }
+            mp[nums[i]]=i;
+        }
+        return v;
+    }
+};

LC_1018.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    vector<bool> prefixesDivBy5(vector<int>& A) {
+        vector<bool>res;
+        if(A.size()==0)
+            return res;
+        long long int i,sz=A.size(),val=A[0],con=0;
+        if(val%5==0)
+            res.push_back(true);
+        else
+            res.push_back(false);
+        for(i=1;i<sz;i++)
+        {
+            val = (2*val + A[i])%5;
+            if(val==0)
+            res.push_back(true);
+        else
+            res.push_back(false);
+        }
+        return res;
+    }
+};

LC_1021.cpp

@@ -0,0 +1,34 @@
+class Solution {
+public:
+    string removeOuterParentheses(string S) {
+        int i,len=S.length(),left=0,flag=0;
+        string res="",ans="";
+        for(i=0;i<len;i++)
+        {
+            if((S[i]=='(')&&(flag==0))
+            {
+                left++;
+                flag=1;
+            }
+            else if(S[i]=='(')
+            {
+                res=res+S[i];
+                left++;
+            }
+            else if(S[i]==')')
+            {
+                left--;
+            if(left>0)
+                res=res+')';
+            else if(left==0)
+            {
+                flag=0;
+                if(res!="")
+                    ans=ans+res;
+                res="";
+            }
+            }
+        }
+        return ans;
+    }
+};

LC_1029.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    int twoCitySchedCost(vector<vector<int>>& costs) {
+       int i,len=costs.size(),sum=0;
+        vector<int>saving(len);
+        for(i=0;i<len;i++)
+        {
+            sum=sum+costs[i][0];
+            saving[i]=costs[i][1]-costs[i][0];
+        }
+        sort(saving.begin(),saving.end());
+        for(i=0;i<saving.size()/2;i++)
+            sum=sum+saving[i];
+        return sum;
+    }
+};

LC_1037.cpp

@@ -0,0 +1,9 @@
+class Solution {
+public:
+    bool isBoomerang(vector<vector<int>>& points) {
+        int x1=points[0][0],y1=points[0][1],x2=points[1][0],y2=points[1][1],x3=points[2][0],y3=points[2][1];
+        double area = (x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2))*0.5;
+
+        return area!=0;
+    }
+};

LC_1042.cpp

@@ -0,0 +1,35 @@
+class Solution {
+public:
+    vector<int> gardenNoAdj(int N, vector<vector<int>>& paths) {
+        vector<vector<int>>graph(N+1);
+        vector<int>options = {1,2,3,4};
+        int i,sz=paths.size(),src,parent,neighbor,col,j,k;
+        bool found;
+        for(i=0;i<sz;i++)
+        {
+            graph[paths[i][0]-1].push_back(paths[i][1]-1);
+            graph[paths[i][1]-1].push_back(paths[i][0]-1);
+        }
+
+        vector<int>res(N,-1);
+       for(i=0;i<N;i++)
+       {
+           for(k=0;k<4;k++)
+           {
+               col = options[k];
+               found=false;
+               for(j=0;j<graph[i].size();j++)
+               {
+                   if((res[graph[i][j]]!=-1) && (res[graph[i][j]]==col))
+                       found=true;
+               }
+               if(!found)
+               {
+                   res[i]=col;
+                   break;
+               }
+           }
+       }
+        return res;
+    }
+};

LC_1089.cpp

@@ -0,0 +1,17 @@
+class Solution {
+public:
+    void duplicateZeros(vector<int>& arr) {
+        int i,j,sz=arr.size();
+        for(i=0;i<sz;)
+        {
+            if(arr[i]==0)
+            {
+                for(j=sz-2;j>=i;j--)
+                    arr[j+1]=arr[j];
+                i=i+2;
+            }
+            else
+                i++;
+        }
+    }
+};

LC_1100.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    int numKLenSubstrNoRepeats(string S, int K) {
+        int i,len=S.length(),j,con=0;
+        if(len<K)
+            return con;
+        unordered_map<char,int>mp;
+        for(i=0;i<K;i++)
+            mp[S[i]]++;
+        if(mp.size()==K)
+            con++;
+        for(i=K;i<len;i++)
+        {
+            mp[S[i-K]]--;
+            if(mp[S[i-K]]==0)
+                mp.erase(S[i-K]);
+            mp[S[i]]++;
+            if(mp.size()==K)
+                con++;
+        }
+        return con;
+    }
+};

LC_1109.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    vector<int> corpFlightBookings(vector<vector<int>>& bookings, int n) {
+        int i,len=bookings.size(),x,y;
+        vector<int>ans(n,0);
+        for(i=0;i<len;i++)
+        {
+            x=bookings[i][0]-1;
+            y=bookings[i][1]-1;
+            ans[x] += bookings[i][2];
+            if(y+1<n)
+                ans[y+1] -= bookings[i][2];
+        }
+        for(i=1;i<n;i++)
+            ans[i] += ans[i-1];
+        return ans;
+    }
+};

LC_121.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int maxProfit(vector<int>& prices) {
+        int i,len=prices.size(),buy,sell=INT_MIN,currentprofit,maxprofit=INT_MIN;
+        if(len<=1)
+            return 0;
+        buy=prices[0];
+        for(i=1;i<len;i++)
+        {
+            sell=prices[i];
+            currentprofit=sell-buy;
+            maxprofit=max(maxprofit,currentprofit);
+            buy=min(buy,prices[i]);
+        }
+
+        return maxprofit<0? 0:maxprofit;
+    }
+};