Stock Trading Maximum Profit Problem

Given the stock prices for 'N' days, your goal is to determine the maximum profit that can be achieved. You can buy and sell the stocks any number of times but can only hold one share at a time.

Input:

The first line contains an integer 't', representing the number of test cases. For each test case:
The first line contains a single integer 'N', the number of days.
The second line contains 'N' space-separated integers representing the stock prices on each day.

Output:

For each test case, output the maximum profit possible, printed on a new line for each test case.

Example:

Input:
t = 2
N = 6
prices = [7, 1, 5, 3, 6, 4]
N = 5
prices = [1, 2, 3, 4, 5]
Output:
7
4

Constraints:

  • 1 <= t <= 10^2
  • 0 <= N <= 10^5
  • Time Limit: 1 sec

Note:

Implement the function; printing is handled for you. You may perform multiple transactions to achieve maximum profit, but no overlapping transactions.

Be the first one to answer
Add answer anonymously...
LinkedIn Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter
Profile Image
Hello, Guest
Awards 2025
Contribute to help millions!
Write a review
Write a review
Share interview
Share interview
Contribute salary
Contribute salary
Add office photos
Add office photos
Add office benefits
Add office benefits
Stay ahead in your career with AmbitionBox app