<jupyter_start><jupyter_text>A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.Find the largest palindrome made from the product of two 3-digit numbers.<jupyter_code>largest = 0

for i in range(100,1000):
    for j in range(100,1000):
        int_num = i*j
        str_num = str(int_num)
        if str_num == str_num[::-1] and int_num > largest:
            largest = int_num
            
print(largest)<jupyter_output>906609
{'fraction_non_alphanumeric': 0.08055009823182711, 'fraction_numerical': 0.06286836935166994, 'mean_word_length': 3.1129032258064515, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 5, 'https://': 0, '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': '86854', 'license': 'MIT', 'n_tokens_mistral': 195, 'n_tokens_neox': 165, 'n_words': 57, 'path': 'project-euler/4.ipynb', 'repo_name': 'bentrevett/py-algorithms', 'size': '509'}