DIY: Best Time to Buy and Sell Stock
Explore how to solve the classic stock trading problem by implementing an algorithm that identifies the maximum profit you can achieve from one buy and one sell transaction in a stock price array.
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]