# 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*. ## Getting Started Make sure you have read [D page](http://exercism.io/languages/dlang) on exercism.io. This covers the basic information on setting up the development environment expected by the exercises. ## Passing the Tests Get the first test compiling, linking and passing by following the [three rules of test-driven development](http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd). Create just enough structure by declaring namespaces, functions, classes, etc., to satisfy any compiler errors and get the test to fail. Then write just enough code to get the test to pass. Once you've done that, uncomment the next test by moving the following line past the next test. ```D static if (all_tests_enabled) ``` This may result in compile errors as new constructs may be invoked that you haven't yet declared or defined. Again, fix the compile errors minimally to get a failing test, then change the code minimally to pass the test, refactor your implementation for readability and expressiveness and then go on to the next test. Try to use standard D facilities in preference to writing your own low-level algorithms or facilities by hand. [DRefLanguage](https://dlang.org/spec/spec.html) and [DReference](https://dlang.org/phobos/index.html) are references to the D language and D standard library. ## 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.