History

Blizzard Finnegan b92478b09c Init commit Leap, Difference of Squares, Grains, Collatz Conjecture, Queen Attack, Darts, Hamming, and Space Age completed yesterday. Binary and Linked List completed today.		2025-01-11 18:45:47 -05:00
..
.exercism	Init commit	2025-01-11 18:45:47 -05:00
test-framework	Init commit	2025-01-11 18:45:47 -05:00
HELP.md	Init commit	2025-01-11 18:45:47 -05:00
largest_series_product.c	Init commit	2025-01-11 18:45:47 -05:00
largest_series_product.h	Init commit	2025-01-11 18:45:47 -05:00
makefile	Init commit	2025-01-11 18:45:47 -05:00
README.md	Init commit	2025-01-11 18:45:47 -05:00
test_largest_series_product.c	Init commit	2025-01-11 18:45:47 -05:00

README.md

Largest Series Product

Welcome to Largest Series Product on Exercism's C Track. If you need help running the tests or submitting your code, check out HELP.md.

Instructions

Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.

For example, for the input '1027839564', the largest product for a series of 3 digits is 270 (9 * 5 * 6), and the largest product for a series of 5 digits is 7560 (7 * 8 * 3 * 9 * 5).

Note that these series are only required to occupy adjacent positions in the input; the digits need not be numerically consecutive.

For the input '73167176531330624919225119674426574742355349194934', the largest product for a series of 6 digits is 23520.

Source

Created by

@ryanplusplus

Contributed to by

@bcc32
@Gamecock
@gea-migration
@h-3-0
@patricksjackson
@QLaille
@wolf99

Based on

A variation on Problem 8 at Project Euler - http://projecteuler.net/problem=8