Largest palindrome product

Problem: 

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.

Solution:

list = []

for i in range(100, 999):
    for j in range(100, 999):
        num = i * j
        if str(num) == str(num)[::-1]:
            list.append(num)

print(max(list))

Note: This problem was taken from Project Euler (www.projecteuler.net).