Skip to content
This repository has been archived by the owner on Jul 18, 2020. It is now read-only.

Latest commit

 

History

History

stock_prices

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 

Stock Prices

You want to write a bot that will automate the task of day-trading for you while you're going through Lambda. You decide to have your bot just focus on buying and selling Amazon stock.

Write a function find_max_profit that receives as input a list of stock prices. Your function should return the maximum profit that can be made from a single buy and sell. You must buy first before selling; no shorting is allowed here.

For example, find_max_profit([1050, 270, 1540, 3800, 2]) should return 3530, which is the maximum profit that can be made from a single buy and then sell of these stock prices.

Testing

Run the test file by executing python test_stock_prices.py.

You can also test your implementation manually by executing python stock_prices.py [integers_separated_by_a_single_space]

Hints

For this problem, we essentially want to find the maximum difference between the smallest and largest prices in the list of prices, but we also have to make sure that the max profit is computed by subtracting some price by another price that comes before it; it can't come after it in the list of prices.

So what if we kept track of the current_min_price_so_far and the max_profit_so_far?