{
  "authors": [
    "sjakobi"
  ],
  "contributors": [
    "alexpjohnson",
    "behrtam",
    "cmccandless",
    "Dog",
    "fortrieb",
    "iandexter",
    "ikhadykin",
    "kytrinyx",
    "N-Parsons",
    "petertseng",
    "pheanex",
    "tqa236"
  ],
  "files": {
    "solution": [
      "largest_series_product.py"
    ],
    "test": [
      "largest_series_product_test.py"
    ],
    "example": [
      ".meta/example.py"
    ]
  },
  "blurb": "Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.",
  "source": "A variation on Problem 8 at Project Euler",
  "source_url": "https://projecteuler.net/problem=8"
}
