Challenge 5 - completely dynamic solution
Hello,
with what I learned from the solutions to this challenge, I was now able to develop a completely dynamic solution.
Up to a length of 15-digit (expandable) IDs, the from/to range is automatically recognized and the list of new IDs is generated.
For this purpose I determine from and to which position "From" and "To" are different.
Please note that the IDs from 1000 to 3000 are only different at the first position and therefore only the IDs 1000, 2000, 3000 are generated.
Furthermore, the restriction applies here as well, that for the generation of alphabetical IDs, from and to, may only differ at one position.