내일은 알고리즘

https://school.programmers.co.kr/learn/courses/30/lessons/12910

def solution(arr, divisor):
    answer = []
    
    for i in arr:
        if i % divisor == 0:
            answer.append(i)
    
    answer.sort()
    
    return answer if len(answer) != 0 else [-1]

https://school.programmers.co.kr/learn/courses/30/lessons/12948

def solution(phone_number):
    return f"{'*'*(len(phone_number)-4)}{phone_number[-4:]}"

https://school.programmers.co.kr/learn/courses/30/lessons/12919

def solution(seoul):
    for i in range(len(seoul)):
        if seoul[i] == "Kim":
            return f"김서방은 {i}에 있다"

https://school.programmers.co.kr/learn/courses/30/lessons/12912

def solution(a, b):
    return (a + b) * (abs(a - b) + 1) // 2

https://school.programmers.co.kr/learn/courses/30/lessons/12943

def solution(num):
    answer = 0
    
    while num != 1 and answer <= 500:
        if num % 2 == 0:
            num //= 2
        else:
            num = (num * 3) + 1
        
        answer += 1
        
    return answer if answer <= 500 else -1

https://school.programmers.co.kr/learn/courses/30/lessons/87389

def solution(n):
    for i in range(2, n):
        if n % i == 1:
            return i

https://school.programmers.co.kr/learn/courses/30/lessons/12954

def solution(x, n):
    answer = []
    d = x
    for i in range(n):
        answer.append(x)
        x += d
    return answer

https://school.programmers.co.kr/learn/courses/30/lessons/12925

def solution(s):
    answer = int(s)
    return answer