121.best_time_to_buy_and_sell_stock

Author: Deftly

leetcode/121.best_time_to_buy_and_sell_stock/121.best_time_to_buy_and_sell_stock.go

@@ -0,0 +1,17 @@
+package data_structures_algorithms
+
+func maxProfit(prices []int) int {
+	if len(prices) <= 1 {
+		return 0
+	}
+	min, maxProfit := prices[0], 0
+	for i := 1; i < len(prices); i++ {
+		if prices[i]-min > maxProfit {
+			maxProfit = prices[i] - min
+		}
+		if prices[i] < min {
+			min = prices[i]
+		}
+	}
+	return maxProfit
+}

leetcode/121.best_time_to_buy_and_sell_stock/README.md

@@ -0,0 +1,24 @@
+# [121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)
+You are given an array `prices` where `prices[i]` is the price of a given stock on the <code>i<sup>th</sup></code> day.
+
+You want to maximize your profit by choosing a **single day** to buy one stock and choosing a **different day in the future** to sell that stock.
+
+Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return `0`.
+
+#### Example 1:
+```shell 
+Input: prices = [7,1,5,3,6,4]
+Output: 5
+```
+
+#### Example 2:
+```shell
+Input: prices = [7,6,4,3,1]
+Output: 0
+```
+
+<br>
+
+#### Constraints:
+- <code>1 <= prices.length <= 10<sup>5</sup></code>
+- <code>0 <= prices[i] <= 10<sup>4</sup></code>