EasyEasy array problems from the Blind 75 list.In this sectionBest Time to Buy and Sell StockOne-pass solution that tracks the minimum price seen so far to maximize profit. O(n) time, O(1) space.Two SumHash map solution to the classic Two Sum problem: find the indices of the two numbers that add up to a target in O(n) time and O(n) space.