Скачать или смотреть Leetcode 121. Best Time to Buy and Sell Stock | Hindi | Python | Leetcode 1 | Optimized way

#leetcode #python #timecomplexity
Q. 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.



Example 1:

Input: prices = [7,1,5,3,6,4]
Output: 5

Solution -
Optimized way - Note - this is sample code.. we cannot use angle brackets in description, so I removed them from the code.

class Solution:
def maxProfit(self, prices: List[int]) - int:

minp = prices[0]
maxprof = 0

for p in prices:

maxprof = max(maxprof, (p - minp))
minp = min(minp, p)

return maxprof

#python #leetcodesolutions #dsa #pythoninterviewquestions

Python Developer Interview Questions Answers
Top 10 Python Developer Interview Questions Answer
Mostly asked Python Developer Interview Questions Answer
Commonly asked Python Developer Interview Questions Answer



Tags -
Python leetcode problems
leetcode two sum
leetcode solutions
leetcode hindi
two sum python
two sum problem