7 - Stock Buy and Sell (With No Limit)

Author: PTHARRISH

geek_for_geeks/challenge/Secondlargest.py

@@ -22,43 +22,43 @@ def getSecondLargest(arr):
 
 
 # Using Two iteration
-def getSecondLargest(arr):
-    n = len(arr)
-    first = second = float("-inf")
-    if n < 2:
-        return -1
-    for i in range(len(arr)):
-        if arr[i] > first:
-            first = arr[i]
-    for i in range(len(arr)):
-        if arr[i] != first and second < first and arr[i] > second:
-            second = arr[i]
+# def getSecondLargest(arr):
+#     n = len(arr)
+#     first = second = float("-inf")
+#     if n < 2:
+#         return -1
+#     for i in range(len(arr)):
+#         if arr[i] > first:
+#             first = arr[i]
+#     for i in range(len(arr)):
+#         if arr[i] != first and second < first and arr[i] > second:
+#             second = arr[i]
 
-    if second == float("-inf"):
-        return -1
-    return second
+#     if second == float("-inf"):
+#         return -1
+#     return second
 
 
 # T.C = O(2n)
 # S.C = O(1)
 
 
 # Using sorted()
-def getSecondLargest(arr):
-    n = len(arr)
-    data = sorted(arr)
-    first = second = float("-inf")
-    if n < 2:
-        return -1
-    else:
-        first = max(arr)
-    for i in range(len(data) - 1, 0, -1):
-        if data[i] != first:
-            second = data[i]
-            break
-    if second == float("-inf"):
-        return -1
-    return second
+# def getSecondLargest(arr):
+#     n = len(arr)
+#     data = sorted(arr)
+#     first = second = float("-inf")
+#     if n < 2:
+#         return -1
+#     else:
+#         first = max(arr)
+#     for i in range(len(data) - 1, 0, -1):
+#         if data[i] != first:
+#             second = data[i]
+#             break
+#     if second == float("-inf"):
+#         return -1
+#     return second
 
 
 # T.C = O(n log n)

geek_for_geeks/challenge/majority_element.py

@@ -1,4 +1,4 @@
-# Majority Element - More Than n/3
+# 6.Majority Element - More Than n/3
 def findMajority(arr):
     data = {}
     n = len(arr)

geek_for_geeks/challenge/move_zero.py

@@ -13,17 +13,17 @@ def pushZerosToEnd(arr):
 # S.C = O(1)
 
 
-def pushZerosToEnd(arr):
-    count = 0
-    n = len(arr)
-    for i in range(n):
-        if arr[i] != 0:
-            arr[count] = arr[i]
-            count += 1
-    while count < n:
-        arr[count] = 0
-        count += 1
-    return arr
+# def pushZerosToEnd(arr):
+#     count = 0
+#     n = len(arr)
+#     for i in range(n):
+#         if arr[i] != 0:
+#             arr[count] = arr[i]
+#             count += 1
+#     while count < n:
+#         arr[count] = 0
+#         count += 1
+#     return arr
 
 
 # T.C = O(2n)

geek_for_geeks/challenge/next_permutation.py

@@ -20,7 +20,7 @@ def nextPermutation(arr):
     return arr
 
 
-print(nextPermutation([1, 2, 4, 5, 6, 0]))
+# print(nextPermutation([1, 2, 4, 5, 6, 0]))
 
 # T.C = O(n)
 # S.C = O(1)

geek_for_geeks/challenge/reverse_an_array.py

@@ -12,14 +12,14 @@ def reverseArray(arr):
 
 
 # Naive method
-def reverseArray(arr):
-    temp = []
-    n = len(arr)
-    for i in range(n):
-        temp.append(arr[n - 1 - i])
-    # for i in range(len(arr) - 1, -1, -1):
-    #     temp.append(arr[i])
-    return temp
+# def reverseArray(arr):
+#     temp = []
+#     n = len(arr)
+#     for i in range(n):
+#         temp.append(arr[n - 1 - i])
+#     # for i in range(len(arr) - 1, -1, -1):
+#     #     temp.append(arr[i])
+#     return temp
 
 
 # T.C = O(n)

geek_for_geeks/challenge/rotate_an_array.py

@@ -21,42 +21,41 @@ def reversal(arr, start, end):
 # S.C = O(1)
 
 
-def rotateArr(arr, d):
-    n = len(arr)
-    d = d % n
-    return arr[d:] + arr[:d]
+# def rotateArr(arr, d):
+#     n = len(arr)
+#     d = d % n
+#     return arr[d:] + arr[:d]
 
 
 # T.C = O(n)
 # S.C = O(n)
 
 
-def rotateArr(arr, d):
-    n = len(arr)
-    temp = []
-    for i in range(d, n):
-        temp.append(arr[i])
-    for j in range(0, d):
-        temp.append(arr[j])
-    return temp
+# def rotateArr(arr, d):
+#     n = len(arr)
+#     temp = []
+#     for i in range(d, n):
+#         temp.append(arr[i])
+#     for j in range(0, d):
+#         temp.append(arr[j])
+#     return temp
 
 
 # T.C = O(n)
 # S.C = O(n)
 
 
-def rotateArr(arr, d):
-    n = len(arr)
-    first = 0
-    for i in range(d):
-        first = arr[0]
-        for j in range(n - 1):
-            arr[j] = arr[j + 1]
-        arr[n - 1] = first
-    return arr
+# def rotateArr(arr, d):
+#     n = len(arr)
+#     first = 0
+#     for i in range(d):
+#         first = arr[0]
+#         for j in range(n - 1):
+#             arr[j] = arr[j + 1]
+#         arr[n - 1] = first
+#     return arr
 
 
 # T.C = O(d*n)
 # S.C = O(1)
 
-print(rotateArr([1, 2, 3, 4, 5], 2))

geek_for_geeks/challenge/stock_buy_and_sell.py

@@ -0,0 +1,32 @@
+# 7 - Stock Buy and Sell (With No Limit)
+# Best Approach
+def maximumProfit(prices):
+    n = len(prices)
+    res = 0
+    for i in range(0, n - 1, 1):
+        if prices[i] < prices[i + 1]:
+            res += prices[i + 1] - prices[i]
+    return res
+
+
+# T.C: O(n)
+# S.C: O(1)
+
+# def maximumProfit(prices):
+#     n = len(prices)
+#     res = 0
+#     lmin = prices[0]
+#     lmax = prices[0]
+#     i = 0
+#     while i < n - 1:
+#         while i < n - 1 and prices[i] >= prices[i]:
+#             i += 1
+#         lmin = prices[i]
+#         while i < n - 1 and prices[i] <= prices[i]:
+#             i += 1
+#         lmax = prices[i]
+#         res += lmax - lmin
+#     return res
+
+# T.C: O(n)
+# S.C: O(1)