[CentralOH] [COhPy] DoJo Rumblings: Tonight's Python Challenge
neil.ludban at gmail.com
Thu Mar 7 12:15:20 EST 2019
With a minor pre-processing of the inputs, there's a O(n) solution with
code (in python) on Wikipedia. :)
On Thu, Mar 7, 2019, 18:57 Travis Risner <deeppunster at gmail.com> wrote:
> Here is a small problem for us to consider. At tonight’s DoJo meeting
> we will work together to solve this as individuals or small groups. We
> will also discuss the advantages of each approach.
> Given a array of numbers representing the stock prices of a
> company in
> chronological order, write a function that calculates the maximum
> profit you
> could have made from buying and selling that stock once. You must
> you can sell it.
> For example, given [9, 11, 8, 5, 7, 10], you should return 5,
> since you
> could buy the stock at 5 dollars and sell it at 10 dollars.
> DoJo is at Smokehouse Brewing, 1130 Dublin Road, Columbus, Ohio. Join
> us at 6:00 or any time after that!
> CentralOH mailing list
> CentralOH at python.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the CentralOH