Number of ways to divide string in sub-strings such to make them in lexicographically increasing sequence.
Thanks in advance.
Number of ways to divide string in sub-strings such to make them in lexicographically increasing sequence.
Thanks in advance.
Also if there, suggest anything where i can read more about these.
What type of help u want in this question ?
In this solution , there is such a loop
for(k=i-1;k>=0;k–)
but this loop will reverse the string and then compares that doesnot mean any sense.
Please elaborate on this.
can we use this concept to solve this problem.
If yes, how ?