Write better code: Day 1 - Apple Stock Prices

#challenge

This post originally appeared on Arjun Rajkumar's blog. Arjun is a web developer based in Bangalore, India.

I'm going to spend 1-2 hours/day solving different algorithms. More about this here.

Day 1: Question 1

Write an efficient method that takes stock_prices and returns the best profit you could have made from one purchase and one sale of one share of Apple stock yesterday.

For example:

  stock_prices = [10, 7, 5, 8, 11, 9]

get_max_profit(stock_prices)
# returns 6 (buying for $5 and selling for $11)

No "shorting"—you need to buy before you can sell. Also, you can't buy and sell in the same time step—at least 1 minute has to pass.

Question from InterviewCake

If you want to follow along, feel free to post your answers below.

Top comments (2)

Arjun Rajkumar • Dec 5 '18 • Edited

This was my logic for doing this.

Logic:

Go thru each price one by one.
See if the current stock is lesser than previous min_stock stored variable.
See if the profit is greater than max profit stored. (max_profit, pot_profit)
Going thru the loop once so it is O[n] time
O[1] space as storing fixed.

It works with these few example cases:
Examples: [10, 7, 5, 8, 11, 9] -> 6 ; [10, 7, 100, 8, 11, 9] -> 92 ; [10] -> 0 ; [10, 2] -> 0.

Code:

Github

M Bellucci • Jan 30 '19 • Edited

In ruby

possible_trades = stock_prices.combination(2).to_a
max_trade_index = possible_trades.map { |x,y| y-x }.each_with_index.max[1]
return possible_trades[max_trade_index]

DEV Community

Write better code: Day 1 - Apple Stock Prices

Day 1: Question 1

Top comments (2)

Read next

7 Best Uptime Kuma Alternatives for Monitoring Service Uptime

PWC 296 String Compression

Excel-lent News: Copilot Takes Your Data to New Heights

Unlocking Web3: Full Stack Decentralized Development