<commit_before><commit_msg>Completed - Largest Palindrome Product<commit_after>
def checkNumber(n):
    string_n = str(n)

    if string_n[::-1] == string_n[::1]:
        return 1
    else:
        return 0



result = 0

for i in range(100, 1000):
    for j in range(100, 1000):
        if checkNumber(i*j) == 1:
            if i*j > result:
                result = i*j

print result
{'fraction_non_alphanumeric': 0.11948051948051948, 'fraction_numerical': 0.05194805194805195, 'mean_word_length': 2.190082644628099, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 4, '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}}
{'dir': 'git-commits-cleaned', 'id': '1654246', 'n_tokens_mistral': 152, 'n_tokens_neox': 131, 'n_words': 38}