silver-ring-data

def solution(X, Y):
    # 공통점 찾고
    # 큰순서대로 나열
    
    x_counts = [0] * 10
    y_counts = [0] * 10
    
    for current_x in X :
        x_counts[int(current_x)] += 1
    for current_y in Y :

silver-ring-data

from collections import deque

def solution(priorities, location):
    queues = deque((index,priority) for index, priority in enumerate(priorities))
    
    count = 0
    
    while queues:
        highest_priority = max(queues, key=lambda x: x[1])[1]
        current_index,current_priority = queues.popleft()

silver-ring-data

def solution(cards1, cards2, goal):
    
    for goal_card in goal :
        issame = False
        if cards1:
            if goal_card == cards1[0] :
                cards1.pop(0)
                issame = True
        if cards2:
            if goal_card == cards2[0] :

silver-ring-data

def solution(progresses, speeds):
    ends = []
    for prog, speed in zip(progresses, speeds) :
        end = (100 - prog)//speed
        end_remain = (100 - prog)%speed
        if end_remain :
            end += 1
        ends.append(end)
    
    answer = []

silver-ring-data

def function(N,K) :
  
  people = [num+1 for num in range(N)]
  result = []
  current_index = 0

  while people:
    
    current_index = (current_index + K-1) % len(people) # 출발 인덱스 바꾸기
    result.append(people.pop(current_index))

silver-ring-data

def solution(n, k, cmd):
    results = ['O'] * n
    deletes = [] # (이전행, 현재행, 다음행)의 튜플 리스트임
    # n = 처음 표의 행 개수
    # k = 현재 위치
    table = {i: [i - 1, i + 1] for i in range(n)} # {현재행: [이전행, 다음행]}
    
    table[0][0] = None
    table[n - 1][1] = None
    

silver-ring-data

def solution(board, moves):

    buckets = []
    answer = 0 # 인형 터진 횟수
    for move in moves :
        col = move - 1 
        for row in range(len(board)):
            doll_number = board[row][col]
            
            if doll_number : #0이 아닐때

silver-ring-data

def solution(prices):

n = len(prices)
    answer = [0] * n
    
    for i in range(n):
        # 현재 가격보다 뒤에 있는 가격들을 하나씩 확인
        for j in range(i + 1, n):
            # 1초가 지났으므로 시간을 더함
            answer[i] += 1

silver-ring-data

def solution(s):
    stack = []
    
    for char in s:
        # 스택에 무언가 있고, 맨 위 글자가 현재 글자와 같다면? -> 짝꿍 발견!
        if stack and stack[-1] == char:
            stack.pop()
        # 그 외의 모든 경우 (스택이 비었거나, 글자가 다르거나) -> 일단 쌓기
        else:
            stack.append(char)

silver-ring-data

def is_able(s):
    pairs = {')': '(', ']': '[', '}': '{'}
    stack = []

    for current_s in s:
        # 1. 여는 괄호인 경우
        if current_s in pairs.values():
            stack.append(current_s)
        
        # 2. 닫는 괄호인 경우