Given a string of digits, output all the contiguous substrings of length n
in
that string in the order that they appear.
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.
Execute the tests with:
$ elixir series_test.exs
In the test suites, all but the first test have been skipped.
Once you get a test passing, you can unskip the next one by
commenting out the relevant @tag :pending
with a #
symbol.
For example:
# @tag :pending
test "shouting" do
assert Bob.hey("WATCH OUT!") == "Whoa, chill out!"
end
Or, you can enable all the tests by commenting out the
ExUnit.configure
line in the test suite.
# ExUnit.configure exclude: :pending, trace: true
If you're stuck on something, it may help to look at some of the available resources out there where answers might be found.
A subset of the Problem 8 at Project Euler http://projecteuler.net/problem=8
It's possible to submit an incomplete solution so you can see how others have completed the exercise.