DIY: Best Time to Buy and Sell Stock
Explore how to create an efficient algorithm to determine the best time to buy and sell stock for maximum profit using a single transaction. This lesson helps you understand problem-solving techniques for stock price arrays and implement a solution in Swift for coding interviews.
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]