Sha256: 3d962f2d34a2a31ded0689ff9c63c00ba911a3aa2fa860eba9b5388d6fcc57e3
Contents?: true
Size: 1.26 KB
Versions: 106
Compression:
Stored size: 1.26 KB
Contents
# Series Given a string of digits, output all the contiguous substrings of length `n` in that string. For example, the string "49142" has the following 3-digit series: - 491 - 914 - 142 And the following 4-digit series: - 4914 - 9142 And if you ask for a 6-digit series from a 5-digit string, you deserve whatever you get. Note that these series are only required to occupy *adjacent positions* in the input; the digits need not be *numerically consecutive*. ## Elm Installation Refer to the [Exercism help page](http://exercism.io/languages/elm) for Elm installation and learning resources. ## Writing the Code The first time you start an exercise, you'll need to ensure you have the appropriate dependencies installed. ```bash $ npm install ``` Execute the tests with: ```bash $ npm test ``` Automatically run tests again when you save changes: ```bash $ npm run watch ``` As you work your way through the test suite, be sure to remove the `skip <|` calls from each test until you get them all passing! ## 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
106 entries across 106 versions & 1 rubygems