title: Find all substrings in a string using recursion Python 3
body: <p>How would you make a list of all the possible substrings in a string using recursion? (no loops) I know that you can recurse using s[1:] to cut off the first position and s[:-1] to cut off the last position. So far I have come up with this:</p>
  
  <pre><code>def lst_substrings(s):
    lst = []
    if s == "":
      return lst
    else:
      lst.append(s)
      return lst_substrings(s[1:])
  </code></pre>
  
  <p>but this would only make a list of all the substrings that are sliced by the first position if it worked</p>