dolphin's journey dolphin's journey

K번째 수 - https://school.programmers.co.kr/tryouts/85941/challenges def solution(array, commands): ans = [] for i, j, k in commands: tmp = array[i-1:j] tmp.sort() ans.append(tmp[k-1]) return ans 숫자 짝꿍 - https://school.programmers.co.kr/tryouts/85942/challenges def solution(X, Y): ans = "" for i in range(9, -1, -1): x, y = X.count(str(i)), Y.count(str(i)) if x * y > 0: # 둘 모두 존재 ans += str(i) * min..