TIL - 코드카타

알고리즘

 

from itertools import combinations

def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            return False
    return True

def solution(nums):
    count = 0
    for triplet in combinations(nums, 3):
        total = sum(triplet)
        if is_prime(total):
            count += 1
    return count

 

SQL

 

SELECT A.ANIMAL_ID, A.NAME
FROM ANIMAL_INS A
JOIN ANIMAL_OUTS B ON A.ANIMAL_ID = B.ANIMAL_ID
ORDER BY (B.DATETIME - A.DATETIME) DESC
LIMIT 2;