용감해지고 싶은 쫄보의 도전기

리트코드 Curated SQL 70 중 Medium  1) case이용select stock_name, sum(case when operation = "BUY" then -price else price end ) as capital_gain_lossfrom Stocksgroup by stock_name 2) self join 이용with grouped as (select stock_name, operation, sum(price) as price from Stocks group by stock_name, operation order by stock_name, o..

프로그래머스 알고리즘 KIT - 스택/큐 1. 이중루프 시간복잡도 O(n^2) 성능: 메모리: 19.4 MB, 시간: 72.74 msfrom collections import dequedef solution(prices): prices = deque(prices) answer= [] while prices: item = prices.popleft() count = 0 if not prices: answer.append(0) break for i in prices : count += 1 if item > i: break an..