What is the shortest way to see if an input is a wordinian using any programming language?
A wordinian is a word that contains words of length 1 to the original word's length. For example,
'I' is a word
'in' is a word
'bin' is a word
'a' is a word
'ta' is a word (yes it is)
'age' is a word
'stag' is a word
'stage' is a word
Your code should take a word and a dictionary as inputs, in any reasonable format.
The output should be a value to indicate true or false, to tell us if the word is a wordinian.
Here is a list of words that I will be using as inputs and subwords. Also, in response to @xnor, it has to contain subwords of each length, not a chain of subwords. Note that only one word will be used as an input.