Find the smallest Solution

 You have a positive number n consisting of digits. You can do at most one operation: Choosing the index of a digit in the number, remove this digit at that index and insert it back to another or at the same place in the number in order to find the smallest number you can get.

Task:

Return an array or a tuple or a string depending on the language (see "Sample Tests") with

• 1. the smallest number you got
• 2. the index i of the digit d you took, i as small as possible
• 3. the index j (as small as possible) where you insert this digit d to have the smallest number.

Examples:

smallest(261235) --> [126235, 2, 0] or (126235, 2, 0) or "126235, 2, 0"

126235 is the smallest number gotten by taking 1 at index 2 and putting it at index 0

smallest(209917) --> [29917, 0, 1] or ...

[29917, 1, 0] could be a solution too but index `i` in [29917, 1, 0] is greater than 
index `i` in [29917, 0, 1].

29917 is the smallest number gotten by taking 2 at index 0 and putting it at index 1 which gave 029917 which is the number 29917.

smallest(1000000) --> [1, 0, 6] or ...

Note

Have a look at "Sample Tests" to see the input and output in each language

Solution

 
public class ToSmallest {
    
    public static long[] smallest(long n) {
        // your code
      String s = Long.toString(n), fresh = s;
    long [] ans = new long[3];
    
        int l = s.length();
        for (int i = 0; i < l; i++) {
            char c = s.charAt(i);
            String fstr = s.substring(0, i) + s.substring(i+1, l);
            for (int j = 0; j < l; j++) {
                String sstr = fstr.substring(0, j) + c 
                                +fstr.substring(j, fstr.length());
                int cmp = sstr.compareTo(fresh);
                if (cmp < 0) {
                    fresh = sstr;
                    ans[0] = Long.parseLong(fresh);
                    ans[1] = i;
                    ans[2] = j;
                }
            }
        }

        return ans; 
    }
}