Update algorithms/dynamic_programming/buy_sell_stock/__init__.py

Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>

Author: BrianLusina

algorithms/dynamic_programming/buy_sell_stock/__init__.py

@@ -33,8 +33,19 @@ def max_profit_two_pointers(prices: List[int]) -> int:
     Space: O(1), no extra memory is used
     Time: O(n), where n is the size of the input list & we iterate through the list only once
     """
+def max_profit_two_pointers(prices: List[int]) -> int:
+    """
+    Variation of max_profit using 2 pointers
+    Complexity Analysis:
+    Space: O(1), no extra memory is used
+    Time: O(n), where n is the size of the input list & we iterate through the list only once
+    """
+    if prices is None or len(prices) < 2:
+        return 0
+
     number_of_prices = len(prices)
-    if prices is None or number_of_prices < 2:
+
+    left, right = 0, 1
         return 0
 
     left, right = 0, 1