Sha256: 2461ba77fcc3a90aa7fc6ac383dacf53cfec4c895c2efd51c7047a7e00947e35
Contents?: true
Size: 1.07 KB
Versions: 174
Compression:
Stored size: 1.07 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*. * * * * For installation and learning resources, refer to the [exercism help page][]. [exercism help page]: http://exercism.io/languages/lfe To run the provided tests, you will need `make`. Open a terminal window and run the following from the exercise directory: ```sh make test ``` You should now be able to see the results of the test suite for the exercise. ## 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
174 entries across 174 versions & 1 rubygems