
Asked in Amazon
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...
Top Software Developer Interview Questions Asked at Amazon
Q. What is OOPS?
Q. What is Java programming?
Q. Could you describe the process for designing a data structure that allows for al...read more
Interview Questions Asked to Software Developer at Other Companies
Top Skill-Based Questions for Amazon Software Developer
Algorithms Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
Web Development Interview Questions and Answers
250 Questions
Java Interview Questions and Answers
250 Questions
SQL Interview Questions and Answers
250 Questions
Software Development Interview Questions and Answers
250 Questions
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

