Absolute Permutation.java solution not working

[javaHelper]

No description provided.

[Aabhas99]

Can you please provide the description or the test case?

[javaHelper]

Can u try once on hackerank platform

[javaHelper]

All test cases are breaking.. here is the code -

public static List<Integer> absolutePermutation(int n, int k) {
        Integer ar[] = new Integer[n];
        try {
            for (int x = 1; x <= n; x++) {
                if (x - k > 0 && ar[x - k - 1] == 0) {
                    ar[x - k - 1] = x;
                } else {
                    ar[x + k - 1] = x;
                }
            }
        } catch (Exception e) {
            Integer q[] = {-1};
            return Arrays.stream(q).collect(Collectors.toList());
        }
        return Arrays.stream(ar).collect(Collectors.toList());
    }