가장 가까운 글자 (프로그래머스, Python)

def solution(s):
    answer = []
    past = []
    for i, j in enumerate(s):
        if j not in past:
            answer.append(-1)
            past.append(j)
        else:
            answer.append(s[:i][::-1].find(j) + 1)

    return answer


if __name__ == '__main__':
    print(solution("banana"))

다른 문제 정답 보기

• https://github.com/develly/CodingTest/tree/main/programmers