Problem4_BestTimetoBuyandSellStock.cpp

//Link: https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int minimum=INT_MAX;
       int maximum_profit=0;
        for(int i=0;i<prices.size();i++)
        {
            minimum=min(minimum,prices[i]);
            maximum_profit=max(maximum_profit,prices[i]-minimum);
        }
        return maximum_profit;
    }
};