import numpy as np
def solution(arr1, arr2):
return np.dot(arr1, arr2).tolist()
from functools import reduce
def solution(n):
return reduce(lambda x, _ :[x[1], x[0] + x[1]], range(n-1), [0, 1])[1] % 1234567
from functools import reduce
def solution(A, B):
A.sort()
B.sort(reverse = True)
return reduce(lambda x, y : x + y[0]*y[1], zip(A, B), 0)
def solution(s):
arr = sorted(map(int, s.split(' ')))
return '{} {}'.format(arr[0], arr[-1])
def solution(s) :
stack = []
for alphabet in s :
if stack and stack[-1] == alphabet:
stack.pop()
else :
stack.append(alphabet)
return 1 * (not stack)
def solution(s) :
answer = [0, 0]
while s != '1' :
num_zeros = s.count('0')
s = bin(len(s) - num_zeros)[2:]
answer[0] += 1
answer[1] += num_zeros
return answer
def solution(n):
stack = [1]
answer = 0
sum_stack = 1
i = 2
while i <= n + 1:
if sum_stack == n:
answer += 1
sum_stack -= stack.pop(0)
if sum_stack < n:
stack.append(i)
sum_stack += i
i += 1
else:
sum_stack -= stack.pop(0)
return answer
from functools import reduce
from fractions import gcd
def solution(arr = [2,3, 4]):
gcdArr = reduce(gcd, arr, arr[0])
return reduce(lambda x, y : x*y//gcd(x, y), arr, gcdArr)
def solution(s):
return ' '.join([word.capitalize() for word in s.split(" ")])
capitalize : ๋จ์ด์ ์ฒซ๋ฌธ์๋ฅผ ๋๋ฌธ์๋ก ๋ฐ๊ฟ์ฃผ๋ ํจ์