121. Best Time to Buy and Sell Stock
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.
video by Mohit Bodhija
leetcode 121 python,leetcode best time to buy and sell stock,leetcode 121,leetcode best time to buy and sell stock iv,leetcode best time to buy and sell stock ii,leetcode 121 best time to buy and sell stock,leetcode best time to buy and sell stock iii,software developer,binary search tree,leetcode,learn to code,data structures,time complexity,software engineer,phone screen,tree traversal,python,whiteboard interview,big tech,computer engineer,iterative