mark-novelero/consecutive-substrings

algorithms and data structures

Bonus 5: Consecutive Substrings

Given a string, return all consecutive substrings within that string consisting of at least one character. Substrings should be returned in the order in which they appear.

Note than in the string 'abc', 'ac' is not a consecutive substring.

The input string will have a length of 0 or more.

Input: 'abc'
Output: ['a', 'ab', 'abc', 'b', 'bc', 'c']

Input: 'a'
Output: ['a']

Fork and then clone me!

Use the language of your choosing. We've included starter files for some languages where you can pseudocode, explain your solution and code.

Before you start coding:

1. Rewrite the problem in your own words
2. Validate that you understand the problem
3. Write your own test cases
4. Pseudocode
5. Code!

And remember, don't run our tests until you've passed your own!

How to run your own tests

Ruby

1. cd into the ruby folder
2. ruby <filename>.rb

JavaScript

1. cd into the javascript folder
2. node <filename>.js

How to run our tests

Ruby

1. cd into the ruby folder
2. bundle install
3. rspec

JavaScript

1. cd into the javascript folder
2. npm i
3. npm test