Development Artist

문제 유형 빈칸 난이도 easy Note 1. 해밍 디스턴스(Hamming distance)가 무엇인지. Code def func_a(string, length): padZero = "" padSize = length - len(string) for i in range(padSize): padZero += "0" return padZero + string def solution(binaryA, binaryB): max_length = max(len(binaryA), len(binaryB)) binaryA = func_a(binaryA, max_length) binaryB = func_a(binaryB, max_length) hamming_distance = 0 for i in range(max_lengt..