Maximum Profit Trades

Programming Interview
Questions

← Back

Maximum Profit Trades

You are given a list of daily stock prices where prices[i] is the price of a given stock on the i-th day.

Once you have bought, you must sell in order to buy again. You cannot short sell (i.e. sell and go into negative holdings).

Write a function maximum_profit(prices) to return the maximum profit you can achieve.

Input:

  • prices: A list of numbers, denoting a stock price over time.

Output: The value gained from all maximum profit trades.

Your solution should run in Linear time O(n).

Not Completed

Completed!

maximum_profit.py

Tests - to submit your code!

symbol symbol

Efficiency

symbol symbol

Test Case 1

symbol symbol

Test Case 2

symbol symbol

Test Case 3

symbol symbol

Test Case 4

symbol symbol

Test Case 5

symbol symbol

Test Case 6

symbol symbol

Test Case 7

symbol symbol

Test Case 8

symbol symbol

Test Case 9

symbol symbol

Test Case 10

symbol Submit to See Results

symbol Submit to See Results

symbol Submit to See Results

symbol Submit to See Results

symbol Submit to See Results

symbol Submit to See Results

symbol Submit to See Results

symbol Submit to See Results

symbol Submit to See Results

symbol Submit to See Results

symbol Submit to See Results

Join our Newsletter and Recieve the Latest Updates!

Main Links

Compete Trade Courses Assessments Interview Prep Contact Us

Social Media

Facebook Instagram YouTube

Legal

Terms and Conditions

Talent Acquisition

We help firms recruit dedicated, passionate visionaries in mathematics and innovation for leading technology and trading roles. If your company is looking to attract top-tier talent in these fields, we can connect you with individuals who excel in driving technological and mathematical advancements. For more information, contact us here.

© 2024 EverythingQuant. All Rights Reserved.