- Practice algorithmic problem solving
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']
Use the language of your choosing. We've included starter files for some languages where you can pseudocode, explain your solution and code.
- Rewrite the problem in your own words
- Validate that you understand the problem
- Write your own test cases
- Pseudocode
- Code!
And remember, don't run our tests until you've passed your own!
cd
into the ruby folderruby <filename>.rb
cd
into the javascript foldernode <filename>.js
cd
into the ruby folderbundle install
rspec
cd
into the javascript foldernpm i
npm test