New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Best time to buy and sell stock

Contributed by

Ratnesh

Medium

0/80

Avg time to solve 30 mins

Success Rate 72 %

0 upvotes

Problem Statement

You are given an array of integers, ‘PRICES’ of size ‘N’, where ‘PRICES[i]’ is the price of a given stock on an ‘i’th day.

You want to maximize the profit by choosing a single day to buy one stock and a different day to sell that stock.

Return the maximum profit you can achieve from this transaction.

Note :

You can’t sell a stock before you buy one.

Example:

Let’s say, ‘PRICES’ =[7, 1, 5, 4, 3, 6]

Purchase stock on day two, where the price is one, and sell it on day six, where the price is 6, profit = 6 - 1 = 5.

Hence we return 5.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input Format

The first line contains an integer ‘N’ denoting the size of the array ‘PRICES’.
The second line includes ‘N’ integers denoting the elements of the array ‘PRICES’.

Output format :

Return the maximum profit you can achieve from this transaction.

Note:-

You don't need to print anything. Just implement the given function.

Constraints :

1 <= 'N' <= 10^5
1<= ‘PRICES[i]’<= 10^9, 0<=i<’N-1’

Time Limit: 1 sec

Sample Input 1:

6
7 1 5 4 3 6

Sample Output 1 :

Explanation Of Sample Input 1:

Purchase stock on day two, where the price is one, and sell it on day six, where the price is 6, profit = 6 - 1 = 5.

Sample Input 2:

5
5 4 3 2 1

Sample Output 2 :

Auto

Console