Merge pull request #113 from bhadurajbala22/Leetcode_solutions

Create Two Sum

Author: PawanJaiswal08

Best time to buy and Sell Stock

@@ -0,0 +1,31 @@
+class Solution {
+public:
+    int maxProfit(vector<int>& prices) {
+        
+        int n=prices.size();
+        int max_profit=0;
+        int profit=0;
+        int min=INT_MAX;
+        
+        
+        for(int i=0;i<n;i++)
+        {
+            //for finding the minimum value 
+            
+            if(min>prices[i])
+            {
+                min=prices[i];
+                
+            }
+            //check profit 
+            profit=prices[i]-min;
+            
+            //check if profit is greater then maximum profit or not
+            if(max_profit<profit)
+            {
+                max_profit=profit;
+            }
+        }
+        return max_profit;
+    }
+};

Two Sum

@@ -0,0 +1,31 @@
+class Solution 
+{
+public:
+    vector<int> twoSum(vector<int>& nums, int target)
+    {
+        vector<int> ans;
+        int n=nums.size();
+        
+        for(int i=0;i<n-1;i++)
+        {
+
+            for(int j=i+1;j<n;j++)
+            {
+                if(target==nums[i]+nums[j])
+                    
+                {
+                    
+                  ans.push_back(i);
+                  ans.push_back(j);  
+                    
+                }
+            }
+
+        }
+        
+        return ans;
+        
+    }
+
+
+};