def solution(prices): len_p=len(prices) answer = [0]*len_p for i in range(len_p): tmp=prices[i+1:] for j in tmp: if prices[i]>j: answer[i]+=1 break else : answer[i]+=1 return answer def solution(prices): len_pr=len(prices) answer = [] for i in range(len_pr): tmp=prices[i+1:] cnt=0 for j in tmp: cnt+=1 if prices[i]>j: break answer.append(cnt) return answer from collections import deque def soluti..