DIY: Best Time to Buy and Sell Stock
Explore how to develop an algorithm in Ruby to determine the maximum profit from buying and selling a stock once. Understand problem constraints and implement a solution that analyzes stock price arrays efficiently to aid coding interview preparation.
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]