33.facebook.txt

daily-python-challenge
QUESTION:
This is an interview question asked by Facebook.
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 buy before 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.


Burada çözüm-2 tek satır. Oldukça kısa. Ama kısa kod hızlı kod demek değildir.
Çözüm-2 test data setini 5916 ms de tamamladı.
Çözüm-3 ise test data setini 56 ms de tamamladı.
Arada çok ciddi hız farkı var. 100 kat fark var.