[TIL] Algorithms Day 3 - Stack, Queue, Heap
Problem 1. Stack Permutation
N = int(input())
goal = []
stack = []
count = 0
result = []
compare_lst = []
can_stack = True
for i in range(N):
val = int(input())
goal.append(val)
while val > count:
result.append('+')
coun...
siwonlog.hashnode.dev2 min read