@kimjuha19

arr = [3,6,12,7,1,11,9] find = 11 left = 0 right = len(arr) - 1 answer = 0 while left <= right: mid = (left+right) // 2

n = '(())()' count = 0 for i in n: if i == '(': count += 1 else: count -= 1

participant = ["john", "stanko", "mislav", "ana"] completion = ["stanko", "ana", "mislav"] count = {} for name in participant: if name in count: count[name] += 1 else: count[name] = 1

meetings = [(1, 4), (3, 5), (0, 6), (5, 7), (3, 8), (5, 9), (6, 10), (8, 11), (8, 12), (2, 13), (12, 14)] meetings.sort(key=lambda x: x[1]) count = 0 end_time = 0 for start,end in meetings: if start >= end_time: count += 1

lst = "aaabbc" ans = "" c = 1 for n in range(1, len(lst)): if lst[n] == lst[n - 1]: c += 1 else: ans += str(c) + lst[n - 1]

code = "([{}])" stack = [] open = {')': '(', ']': '[', '}': '{'} is_valid = 0 for ch in code: if ch in '([{': stack.append(ch) elif ch in ')]}':

logs = ["A", "B", "B", "C", "A"] result = [logs[0]] for i in range(1, len(logs)): if logs[i] != result[-1]: result.append(logs[i]) print(result)

count = {} keywords = [ "인공지능", "파이썬", "로봇", "코딩", "인공지능", "메타버스", "파이썬", "코딩", "인공지능", "자율주행", "파이썬", "로봇", "코딩", "자율주행", "인공지능", "아두이노", "로봇", "인공지능", "코딩", "자율주행", "파이썬", "인공지능", "아두이노", "코딩", "데이터", "인공지능", "로봇", "데이터",

count = {} keywords = [ "인공지능", "파이썬", "로봇", "코딩", "인공지능", "메타버스", "파이썬", "코딩", "인공지능", "자율주행", "파이썬", "로봇", "코딩", "자율주행", "인공지능", "아두이노", "로봇", "인공지능", "코딩", "자율주행", "파이썬", "인공지능", "아두이노", "코딩", "데이터", "인공지능", "로봇", "데이터",

def solution(day): for d in range(1,len(day)+1): if day[d] < day[d+1] < day[d+2]: return d return -1 day = [ 0,100, 98, 95, 96, 94, 92, 93, 95, 98, 97, 96, 95, 94, 95, 97, 99, 101, 100, 102, 103, 105, 104,

import heapq # 빈 리스트를 만들고 힙으로 사용합니다. arr = [] patients = [ ("김철수", 5, 101), ("이영희", 9, 102), ("박지민", 2, 103), ("최승우", 10, 104),

counts = {} names = ['파이썬','파이썬','파이썬','파이썬','파이썬','파이썬','C언어','C언어','C언어','C언어','코딩','코딩','코딩','코딩','코딩','C++','C++','C++','HTML','HTML'] for name in names: if name in counts: counts[name] = counts[name] + 1 else: counts[na

list_a = ["명량","극한직업","신과함께-죄와벌","괴물","국제시장","어벤져스-엔드게임","기생충"] list_b = ["극한직업","명량","괴물","어벤져스-엔드게임","신과함께-죄와벌","택시운전사","기생충"] answer = [] count = [] x = set(list_a).intersection(list_b) answer.append(x)

class Book: def __init__(self,title, author): self.title = title self.author = author self.is_available = True def borrow(self): if self.is_available == False: print("이미 대출중입니다") else:

class Account: def __init__(self, balance): self._balance = balance def deposit(self, amount): self._balance += amount def withdraw(self, amount): self._balance -= amount if self._balance < 0:

# def check_brackets(s): # stack = [] # for x in range(len(s)//2): # if s[x] != s[-1-x]: # return False # return True # print(check_brackets("({[]})"))

N = 50 arr = [True] * N arr[0], arr[1] = False, False for x in range(2, int(N ** 0.5) + 1): sum = x while sum + x < N: sum += x arr[sum] = False

def get_primes(n): answer = [] for num in range(2, n): prime = 0 for i in range(2, num): if num % i == 0: prime += 1 if prime == 0: answer.append(num)

def selection_sort(arr): n = len(arr) for i in range(n): min = i for j in range(i,n): if arr[j] < arr[min]: min = j arr[i],arr[min] = arr[min] ,arr[i] return arr

def is_palindrome(word): for i in range(len(word) // 2): if word[i] != word[len(word) - 1 - i]: return False return True word = input() print(is_palindrome(word))