Mastering LeetCode's "Best Time to Buy and Sell Stock" Using Data Structures
Problem Statement
You’re given an array prices, where prices[i] is the price of a stock on day i. You are allowed to buy once and sell once later.Goal: Return the maximum profit you can make. If you can’t make a profit, return 0.
Plain English: Pick ...
my-dsa-journey-from-zero-to-mastery.hashnode.dev3 min read