<jupyter_start><jupyter_text>2021년 1월 12일 화요일 leetCode - Hamming Distance (Python) 문제 : https://leetcode.com/problems/hamming-distance/ 블로그 : https://somjang.tistory.com/entry/leetCode-461-Hamming-Distance-Python  첫번째 시도<jupyter_code>class Solution:
    def hammingDistance(self, x: int, y: int) -> int:
        return bin(x^y).count('1')<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.14130434782608695, 'fraction_numerical': 0.029891304347826088, 'mean_word_length': 5.049180327868853, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 6, 'https://': 2, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '256686', 'license': 'MIT', 'n_tokens_mistral': 163, 'n_tokens_neox': 166, 'n_words': 24, 'path': 'DAY 201 ~ 300/DAY290_[leetCode] Hamming Distance (Python).ipynb', 'repo_name': 'SOMJANG/CODINGTEST_PRACTICE', 'size': '368'}