maxProfit :: [Int] -> Int
maxProfit (p:ps) = fst . foldl go (0, p) $ ps
  where
    go :: (Int, Int) -> Int -> (Int, Int)
    go (profit, minPrice) price = ( max profit (price-minPrice)
                                  , min minPrice price)

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        auto [profit, price] = std::accumulate(
            prices.begin()+1, prices.end(),
            std::make_pair(0, prices[0]),
            [](std::pair<int, int> acc, int price) {
                return std::make_pair(
                    std::max(acc.first, price-acc.second),
                    std::min(acc.second, price)
                );
            }
        );

        return profit;
    }
};

Origin: Garbage collection was invented by American computer scientist John McCarthy around 1959.
Language: It was specifically designed for the Lisp programming language to automate the management of memory for its characteristic list-based data structures.