Code
#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    // Function to find maximum profit from one buy and one sell
    int maxProfit(vector<int>& prices) {
        // Initialize minimum price to a very large number
        int minPrice = INT_MAX;

        // Initialize max profit to 0
        int maxProfit = 0;

        // Traverse through each day's price
        for (int i = 0; i < prices.size(); i++) {
            // If current price is less than the minimum seen so far, update minPrice
            if (prices[i] < minPrice)
                minPrice = prices[i];

            // Calculate profit if stock is sold today
            int profit = prices[i] - minPrice;

            // Update maxProfit if the profit today is better than before
            if (profit > maxProfit)
                maxProfit = profit;
        }

        // Return the best profit found
        return maxProfit;
    }
};

// Driver code
int main() {
    Solution obj;
    vector<int> prices = {7, 1, 5, 3, 6, 4};
    cout << "Maximum Profit: " << obj.maxProfit(prices) << endl;
    return 0;
}
import.java.util.*;
class Solution {
    // Function to find the maximum profit from one buy and one sell
    public int maxP