java
Rearrange the following lines of code to produce a recursive method that yields all ways in which a string can be broken up into substrings of length 1 or 2. For example, the string amber can be broken up in the following ways:
a m b e r
a m b er
a m be r
a mb e r
a mb er
am b e r
am b er
am be r
i need help with my code
1 Reply
⌛ This post has been reserved for your question.
Hey @🌗 ã‚ラー 🌕 パパ 🌓! Please useTIP: Narrow down your issue to simple and precise questions to maximize the chance that others will reply in here./closeor theClose Postbutton above when your problem is solved. Please remember to follow the help guidelines. This post will be automatically closed after 300 minutes of inactivity.
💤 Post marked as dormant
This post has been inactive for over 300 minutes, thus, it has been archived.
If your question was not answered yet, feel free to re-open this post or create a new one.
In case your post is not getting any attention, you can try to use /help ping.
Warning: abusing this will result in moderative actions taken against you.