DIY: Best Time to Buy and Sell Stock
Explore how to develop an algorithm that determines the best day to buy and the best day to sell a stock for maximum profit. This lesson helps you understand problem-solving techniques for stock trading scenarios by analyzing price arrays and implementing a function to return the highest possible profit within one transaction.
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]