Added lots

Author: gahogg

Best Time to Buy and Sell Stock II - Leetcode 122/Best Time to Buy and Sell Stock II - Leetcode 122.cpp

@@ -0,0 +1,30 @@
+#include <vector>
+
+class Solution {
+public:
+    int maxProfit(std::vector<int>& prices) {
+        int i = 0;
+        int lo = prices[0];
+        int hi = prices[0];
+        int profit = 0;
+        int n = prices.size();
+
+        while (i < n - 1) {
+            // Look where to buy
+            while (i < n - 1 && prices[i] >= prices[i + 1]) {
+                i++;
+            }
+            lo = prices[i];
+
+            // Look where to sell
+            while (i < n - 1 && prices[i] <= prices[i + 1]) {
+                i++;
+            }
+            hi = prices[i];
+
+            profit += hi - lo;
+        }
+
+        return profit;
+    }
+};

Best Time to Buy and Sell Stock II - Leetcode 122/Best Time to Buy and Sell Stock II - Leetcode 122.java

@@ -0,0 +1,27 @@
+class Solution {
+    public int maxProfit(int[] prices) {
+        int i = 0;
+        int lo = prices[0];
+        int hi = prices[0];
+        int profit = 0;
+        int n = prices.length;
+
+        while (i < n - 1) {
+            // Look where to buy
+            while (i < n - 1 && prices[i] >= prices[i + 1]) {
+                i++;
+            }
+            lo = prices[i];
+
+            // Look where to sell
+            while (i < n - 1 && prices[i] <= prices[i + 1]) {
+                i++;
+            }
+            hi = prices[i];
+
+            profit += hi - lo;
+        }
+
+        return profit;
+    }
+}

Best Time to Buy and Sell Stock II - Leetcode 122/Best Time to Buy and Sell Stock II - Leetcode 122.js

@@ -0,0 +1,25 @@
+var maxProfit = function(prices) {
+    var i = 0;
+    var lo = prices[0];
+    var hi = prices[0];
+    var profit = 0;
+    var n = prices.length;
+
+    while (i < n - 1) {
+        // Look where to buy
+        while (i < n - 1 && prices[i] >= prices[i + 1]) {
+            i++;
+        }
+        lo = prices[i];
+
+        // Look where to sell
+        while (i < n - 1 && prices[i] <= prices[i + 1]) {
+            i++;
+        }
+        hi = prices[i];
+
+        profit += hi - lo;
+    }
+
+    return profit;
+};

Best Time to Buy and Sell Stock II - Leetcode 122/Best Time to Buy and Sell Stock II - Leetcode 122.py

@@ -0,0 +1,22 @@
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        i = 0
+        lo = prices[0]
+        hi = prices[0]
+        profit = 0
+        n = len(prices)
+
+        while i < n-1:
+            # look where to buy
+            while i < n-1 and prices[i] >= prices[i+1]:
+                i += 1
+            lo = prices[i]
+
+            # look where to sell
+            while i < n-1 and prices[i] <= prices[i+1]:
+                i += 1
+            hi = prices[i]
+            
+            profit += hi - lo
+        
+        return profit # Time: O(n), Space: O(1)

Jump Game II - Leetcode 45/Jump Game II - Leetcode 45.cpp

@@ -0,0 +1,23 @@
+#include <vector>
+#include <algorithm>
+
+class Solution {
+public:
+    int jump(std::vector<int>& nums) {
+        int smallest = 0;
+        int n = nums.size();
+        int end = 0;
+        int far = 0;
+
+        for (int i = 0; i < n - 1; i++) {
+            far = std::max(far, i + nums[i]);
+            
+            if (i == end) {
+                smallest++;
+                end = far;
+            }
+        }
+
+        return smallest;
+    }
+};

Jump Game II - Leetcode 45/Jump Game II - Leetcode 45.java

@@ -0,0 +1,19 @@
+class Solution {
+    public int jump(int[] nums) {
+        int smallest = 0;
+        int n = nums.length;
+        int end = 0;
+        int far = 0;
+
+        for (int i = 0; i < n - 1; i++) {
+            far = Math.max(far, i + nums[i]);
+            
+            if (i == end) {
+                smallest++;
+                end = far;
+            }
+        }
+
+        return smallest;
+    }
+}

Jump Game II - Leetcode 45/Jump Game II - Leetcode 45.js

@@ -0,0 +1,17 @@
+var jump = function(nums) {
+    var smallest = 0;
+    var n = nums.length;
+    var end = 0;
+    var far = 0;
+
+    for (var i = 0; i < n - 1; i++) {
+        far = Math.max(far, i + nums[i]);
+        
+        if (i == end) {
+            smallest++;
+            end = far;
+        }
+    }
+
+    return smallest;
+};

Jump Game II - Leetcode 45/Jump Game II - Leetcode 45.py

@@ -0,0 +1,17 @@
+class Solution:
+    def jump(self, nums: List[int]) -> int:
+        smallest = 0
+        n = len(nums)
+        end, far = 0, 0
+
+        for i in range(n-1):
+            far = max(far, i+nums[i])
+            
+            if i == end:
+                smallest += 1
+                end = far
+        
+        return smallest
+        # Time: O(n)
+        # Space: O(1)
+        

Longest Common Prefix - Leetcode 14/Longest Common Prefix - Leetcode 14.py

@@ -5,12 +5,14 @@ def longestCommonPrefix(self, strs: List[str]) -> str:
         for s in strs:
             if len(s) < min_length:
                 min_length = len(s)
-
+        
+        i = 0
         while i < min_length:
             for s in strs:
                 if s[i] != strs[0][i]:
                     return s[:i]
             i += 1
+        
         return strs[0][:i]
         # Time: O(n * m) where n is the number of strings, m is the min word length
         # Space: O(1)

Remove Duplicates from Sorted Array II - Leetcode 80/Remove Duplicates from Sorted Array II - Leetcode 80.cpp

@@ -0,0 +1,25 @@
+#include <vector>
+
+class Solution {
+public:
+    int removeDuplicates(std::vector<int>& nums) {
+        int j = 1;
+        int count = 1;
+        int n = nums.size();
+
+        for (int i = 1; i < n; i++) {
+            if (nums[i] == nums[i - 1]) {
+                count++;
+            } else {
+                count = 1;
+            }
+
+            if (count <= 2) {
+                nums[j] = nums[i];
+                j++;
+            }
+        }
+
+        return j;
+    }
+};