DIY: Best Time to Buy and Sell Stock
Explore how to solve the stock buy and sell problem by designing an algorithm that finds the maximum profit from one transaction. Learn to analyze stock price data and implement a function that calculates optimal buy and sell days within given constraints.
We'll cover the following...
We'll cover the following...
Problem statement
You have an array for which the ith element is the price of a given stock on day i.
If you are only permitted to complete one transaction at most (e.g, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Note: You cannot sell a stock before you buy one. ...
Input
[7,1,5,3,6,4]