How to get lexicographical order using recursion

I’m able to get all the subsequences of a string but how to print them in lexicographical order ?

Try sorting the input first.
You can convert a string into a character array using the inbuilt method toCharArray()
Suppose a string, s
char[] arr = s.toCharArray();

You can now sort this array and then obtain the result :slight_smile:

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.