@kimjuha19

article = ["apple", "banana", "apple", "cherry", "banana", "apple"] freq = {} for i in article: if i in freq: freq[i] += 1 else: freq[i] = 1

stockprice = [100, 110, 105, 120] stack = [0] * len(stockprice) for i in range(len(stockprice)): for j in range(i+1, len(stockprice)): if stockprice[j] < stockprice[i]: stack[i] = j - i break print(stack)

N = 12 answer = [] for i in range(2,N+1): if N % i == 0: answer.append(i) answer.sort() print(answer)

from collections import deque people = [("일반","A"), ("일반", "B"), ("예약", "C")] dq = deque() for i in range(len(people)): if people[i][0] == "일반": dq.append(people[i][1]) else:

K = 10 count = 0 for i in range(10): for j in range(10): if j == i: continue for k in range(10): if k == i or k == j: continue

times = [(10, 12), (11, 13), (12, 15), (14, 16), (15, 17)] times.sort(key=lambda x: x[1]) count = 0 end_time = 0 for start, end in times: if start >= end_time: count += 1

stock = [1, 2, 3, 4, 5] target = [4, 3, 5, 2, 1] stack = [] index = 0 for book in stock: stack.append(book) while stack and stack[-1] == target[index]: stack.pop()

import itertools arr = ['A', 'B', 'C'] answer = itertools.permutations(arr, 3) print(list(answer))

score = [10, 20, 30, 40, 50] x = 2 y = 4 S = [0] * (len(score) + 1) for i in range(len(score)): S[i + 1] = S[i] + score[i] answer = S[y] - S[x - 1]

num = 21 zone = 2 if num & (1 << zone): print(True) else: print(False)

from collections import deque commands = ["E 민수", "E 지환", "D", "E 하은", "D", "E 소윤"] answer = [] queue = deque() for i in range(len(commands)): if commands[i][0] == "E": answer.append(commands[i]) elif commands[i] == "D":

import heapq data = [2, -2, 1, -1, 0] heap = [] for x in data: if x != 0: heapq.heappush(heap, (abs(x), x)) else: if heap:

n = 4 dp = [0] * (n + 1) dp[1] = 1 dp[2] = 2 for i in range(3,n+1): dp[i] = (dp[i-1] + dp[i-2]) % 10007 print(dp[n])

distance = [3, 2, 4] price = [4, 5, 2, 6] min_price = price[0] answer = 0 for i in range(len(distance)): if price[i] < min_price: min_price = price[i] answer += min_price * distance[i]

distance = [3, 2, 4] price = [4, 5, 2, 6] city_street = 0 low_idx = 0 answer = 0 for i in range(len(price)): if price[i] < price[low_idx]: low_idx = i for j in range(low_idx):

from collections import deque calculation = "RDD" dq = deque([10, 20, 30, 40]) for i in range(len(calculation)): if calculation[i] == "R": dq.rotate(1) else: dq.popleft()

pizza = 12 answer = [] i = 2 while pizza > 1: if pizza % i == 0: pizza = pizza // i answer.append(i) else: i += 1

onemon = ["kim", "lee", "park"] twomon = ["choi", "lee", "kim"] common = set(onemon).intersection(twomon) common_sorted = sorted(common) p = len(common_sorted) print(f"{p}명 {common_sorted}")

book = [10, 20, 15, 18] M = 12 left = 0 right = max(book) answer = 0 while left <= right: mid = (left + right) // 2

num = 72 answer = [] i = 2 while num > 1: if num % i == 0: num = num // i answer.append(i) else: i += 1