i have submitted the solution but its kind of brute force as it generates all substrings in dictionary order but prints only those which are smaller than input.
pls suggest a more efficient solution.
Not able to think efficient code
You will have to generate and store all the possible permutations less than the given string.
You can refer this https://ide.codingblocks.com/s/248165
okay thanks a lot for your help!
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.