dev-note

def solution(arr): answer = [] for i in arr: if answer[-1:] == [i]: continue answer.append(i) return answer

def solution(s): if len(s) % 2 != 0: return s[len(s)//2] else: return s[len(s)//2 -1 : len(s)//2 +1]

def solution(s): s = s.lower() s = list(s) if s.count('p') == s.count('y'): return True elif s.count('p') == 0 and s.count('y') == 0: return True else: return False

def solution(n): answer= '' for i in range(n): if i % 2 == 0: answer += '수' else: answer += '박' return answer

def solution(s, n): lower_list = "abcdefghijklmnopqrstuvwxyz" upper_list = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" result = [] for i in s: if i is " ": result.append(" ") elif i.islower() is True: new = lower_list.find(i) + n result.append(lower_list[new % 26]) else: new = upper_list.find(i) + n result.append(upper_list[new % 26]) return "".join(result)

def solution(n): answer = [] for i in range(1, n+1): if n % i == 0: answer.append(i) return sum(answer)

def solution(n): num = set(range(2,n+1)) for i in range(2,n+1) : if i in num : num -= set(range(2*i, n+1, i)) return len(num)

def solution(strings, n): a=[] for i in strings: i = i[n] + i a.append(i) a.sort() b=[] for i in a: i= i[1:] b.append(i) return b

def solution(a, b): answer = 0 if a == b: return a elif a > b: for i in range(b, a+1): answer+=i return answer else: for i in range(a, b+1): answer+=i return answer

def solution(n): s = list(map(int,str(n))) s = sum(s) return s