Below, you can find another hint for the Challenge.
You should only get here after reading, digesting, and applying the .
If we put fragment_1 and fragment_2 adjacent to each other in string S, then the statements in fragment_2 that will extract these parts must look something like this:
where N is replaced by an appropriate index value.
For instance, the following program
will output ():
Can you develop this into a first solution by choosing appropriate values for S and N?
Try your program in the machine, and see if you can extend it to a complete solution. (Do remember that all statements on a single line is not acceptable as a final solution, because this violates reasonable coding conventions. However, do ignore this requirement for the moment.)
It is your turn ...
If you tried this hint, or do not see how it helps, then you are ready for the .