Sha256: e02f031039806f4a67f472911eda39eccf8002897cf8e7dbb143e5ef50652fc0
Contents?: true
Size: 1.27 KB
Versions: 60
Compression:
Stored size: 1.27 KB
Contents
# Largest Series Product 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. ## Setup Go through the setup instructions for TypeScript to install the necessary dependencies: http://exercism.io/languages/typescript ## Requirements Install assignment dependencies: ```bash $ yarn install ``` ## Making the test suite pass Execute the tests with: ```bash $ yarn test ``` In the test suites all tests but the first have been skipped. Once you get a test passing, you can enable the next one by changing `xit` to `it`. ## Source A subset of the Problem 8 at Project Euler [http://projecteuler.net/problem=8](http://projecteuler.net/problem=8) ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
60 entries across 60 versions & 1 rubygems