Mentor recommendation is:

*"The array returned by the getNumbers method is either missing elements or has extra elements."*I pretty much used the code from this question, but corrected it for N ==0package com.codegym.task.task20.task2025;
import java.util.TreeSet;
/*
Number algorithms
*/
public class Solution {
public static long[] getNumbers(long N) {
if(N <= 0)return new long[0];
int digits = 1 + (int)Math.log10(N);
genpow(digits +1);
numbers = new TreeSet<>();
for(int i = 1; i <= digits; i++){
try{
search(i, 1,0, 0);
}catch (Exception ignored){
}
}
numbers.removeIf(l -> l >= N);
long[] result = new long[numbers.size()];
int i = 0;
for(long l: numbers){
result[i] = l;
i++;
}
return result;
}
public static void main(String[] args) {
long start = System.currentTimeMillis();
long[] arr = getNumbers(9223372036854775807L);
System.out.println(System.currentTimeMillis() - start);
for(long l: arr){
System.out.println(l);
}
System.out.println(arr.length);
}
public static void search(int N, int d, long pow, int index){
if(d == N+1){
if(check(pow)){
numbers.add(pow);
}
//return;
}else {
for(int i = index; i< 10; i++){
try{
search(N, d+1, pow+pows[i][N-1], i);
}catch (Exception ignored){
}
}
}
}
public static boolean check(long number){
long temp = number;
digits = new int[10];
int n = 0;
long sum = 0;
while (temp > 0){
int digit = (int)(temp%10);
digits[digit]++;
n++;
temp /=10;
}
if(number == 0) n =1;
for(int i = 0; i < 10; i++){
sum += digits[i]*pows[i][n -1];
}
return sum == number;
}
static TreeSet<Long> numbers;
static long[][] pows;
static int[] digits;
public static void genpow(int m){
pows = new long[10][m];
for(int i = 0; i < 10; i++){
long p =1;
for(int j = 0; j < m; j++){
p *= i;
pows[i][j] = p;
}
}
}
}