Best time to buy and sell stock -leetcode solution

[adit26data]

You are given an array prices where prices[i] is the price of a given stock on the ith day.

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

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

@Saikat2407 can you assign this to me?

[kmanishprogrammar]

please assign this to me as i would like to work on it

[Krishna02121]

I can contribute the solution of this question in C++ language .

Please assign me this issue with hacktoberfest tag on it

Thankyou