project_euler.problem_004.sol1
==============================

.. py:module:: project_euler.problem_004.sol1

.. autoapi-nested-parse::

   Project Euler Problem 4: https://projecteuler.net/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 x 99.

   Find the largest palindrome made from the product of two 3-digit numbers.

   References:
       - https://en.wikipedia.org/wiki/Palindromic_number



Functions
---------

.. autoapisummary::

   project_euler.problem_004.sol1.solution


Module Contents
---------------

.. py:function:: solution(n: int = 998001) -> int

   Returns the largest palindrome made from the product of two 3-digit
   numbers which is less than n.

   >>> solution(20000)
   19591
   >>> solution(30000)
   29992
   >>> solution(40000)
   39893
   >>> solution(10000)
   Traceback (most recent call last):
       ...
   ValueError: That number is larger than our acceptable range.