Create MaximizeProfitStockProblem.py

Solution to the problem buying selling stock to maximize profit. Checking the global & the current profit mechanism to get the results.

Author: cyborglaksh

MaximizeProfitStockProblem.py

@@ -0,0 +1,40 @@
+# Module to return the maximum profit that can be made after buying and selling the given stocks
+
+def maxProfit(price, start, end):
+
+	# If the stocks can't be bought
+	if (end <= start):
+		return 0
+
+	# Initialise the profit
+	profit = 0
+
+	# The day at which the stock must be bought
+	for i in range(start, end, 1):
+
+		# The day at which the stock must be sold
+		for j in range(i+1, end+1):
+
+			# If buying the stock at ith day and selling it at jth day is profitable
+			if (price[j] > price[i]):
+
+				# Update the current profit
+				current_profit = price[j] - price[i] +\
+					maxProfit(price, start, i - 1) + \
+					maxProfit(price, j + 1, end)
+
+				# Update the maximum profit so far
+				profit = max(profit, current_profit)
+
+	return profit
+
+# Example Driver Code
+if __name__ == '__main__':
+	price = [100, 180, 260, 310, 40, 535, 695]
+	n = len(price)
+
+	print(maxProfit(price, 0, n - 1))
+  
+# Solution: 865
+
+# This code is contributed by Laksh Gupta