# -*- coding: utf-8 -*-

# Problem 4 - Largest palindrome product

# 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.


from itertools import combinations


def euler_4():
    def _is_palindromic(integer):
        s = str(integer)
        return all([s[i] == s[(i * -1) - 1] for i in xrange(len(s) / 2)]) 

    palindromes = filter(_is_palindromic,
                         [x[0] * x[1] for x in
                            combinations(xrange(100, 1000), 2)])
    return max(palindromes)


if __name__ == '__main__':
    assert euler_4() == 906609

f26203d2598ad1a1fd9a2f624d95d8fd0782d07e
<mask token>

<mask token>


def euler_4():

    def _is_palindromic(integer):
        s = str(integer)
        return all([(s[i] == s[i * -1 - 1]) for i in xrange(len(s) / 2)])
    palindromes = filter(_is_palindromic, [(x[0] * x[1]) for x in
        combinations(xrange(100, 1000), 2)])
    return max(palindromes)


<mask token>

<mask token>


def euler_4():

    def _is_palindromic(integer):
        s = str(integer)
        return all([(s[i] == s[i * -1 - 1]) for i in xrange(len(s) / 2)])
    palindromes = filter(_is_palindromic, [(x[0] * x[1]) for x in
        combinations(xrange(100, 1000), 2)])
    return max(palindromes)


if __name__ == '__main__':
    assert euler_4() == 906609

from itertools import combinations


def euler_4():

    def _is_palindromic(integer):
        s = str(integer)
        return all([(s[i] == s[i * -1 - 1]) for i in xrange(len(s) / 2)])
    palindromes = filter(_is_palindromic, [(x[0] * x[1]) for x in
        combinations(xrange(100, 1000), 2)])
    return max(palindromes)


if __name__ == '__main__':
    assert euler_4() == 906609

# -*- coding: utf-8 -*-

# Problem 4 - Largest palindrome product

# 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.


from itertools import combinations


def euler_4():
    def _is_palindromic(integer):
        s = str(integer)
        return all([s[i] == s[(i * -1) - 1] for i in xrange(len(s) / 2)]) 

    palindromes = filter(_is_palindromic,
                         [x[0] * x[1] for x in
                            combinations(xrange(100, 1000), 2)])
    return max(palindromes)


if __name__ == '__main__':
    assert euler_4() == 906609
