Python Note

하루 절반 이상을 알고리즘 해결.

arr.filter
arr.map

setTimeout(), setInterval().

constructor().

resolve().

.then .catch

async function()

map.

class

---

Translate

mystring.translate(str.maketrans("abcdefg","1234567"))

QRCode

    return code[r::q]
not a return code [r:r+1:q]

rindex

solution=lambda x,y:x[:x.rindex(y)+len(y)]

리스트 자르기

def solution(n, slicer, num_list):
    a, b, c = slicer
    return [num_list[:b + 1], num_list[a:], num_list[a:b + 1], num_list[a:b + 1:c]][n - 1]

---

solution=lambda number, n, m: int((number%n) == 0 and (number%m) == 0)
solution=lambda number, n, m: int((number%n) == 0 & (number%m) == 0)
is difference.