Tech for good

https://neetcode.io/problems/daily-temperatures?list=neetcode150 NeetCode neetcode.ioApproach 1 -> nest loop (time complexity: O(n^2)) class Solution: def dailyTemperatures(self, temperatures: List[int]) -> List[int]: res = [] # t = temperature[i] for i, t in enumerate(temperatures): j = i+1 while j = temperatures[j]: j+=1 ..

https://neetcode.io/problems/minimum-stack?list=neetcode150 NeetCode neetcode.ioclass MinStack: def __init__(self): self.stack = [] self.min_stack = [] def push(self, val: int) -> None: self.stack.append(val) if self.min_stack: min_stack_element = self.min_stack[-1] self.min_stack.append(min(val, min_stack_element)) else: ..