HackerCards for Leanne

Solution.java

public class Solution {
    static int[] hackerCards(int[] collection, int d) {
        List<Integer> result = new ArrayList<>();
        int s, e;
        for(int idx = 0; idx <= collection.length; idx++) {
            if (idx == 0) s = 1; else s = collection[idx-1] + 1;
            if (idx != collection.length) e = collection[idx]; else e = Integer.MAX_VALUE;
            if (d < s) break;
            for (int k = s; k < e; k++) {
                if (k <= d) {
                    result.add(k);
                    d -= k;
                } else {
                    break;
                }
            }
        }

        return result.stream().mapToInt(i->i).toArray();
    }
}

Can you please explain the solution ?

can you give explaination for this?

I too would like an explanation of the code. I recently had to do this problem and would like to compare my answer to yours!

Will the input Collections come in ascending order?