SUPER SIMPLE Implementation In PYTHON LeetCode 121. Best Time to Buy and Sell Stock

We are solving the LeetCode problem Best Time to Buy and Sell Stock (https://leetcode.com/problems/best-ti...) in Python.

Problem Description:
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.

Check out my socials:
Blog: https://arjunthecoder.com/
Instagram: @arjun.the.coder