Missing Test Case - 970. Powerful Integers

[IgorRud]

Your LeetCode username

igor84

Category of the bug

• Question
• Solution
• Language

Description of the bug

A solution is accepted but fails on the following test case:

23
1
250000

Code you used for Submit/Run operation

class Solution {
    public List<Integer> powerfulIntegers(int x, int y, int bound) {
        Set<Integer> set = new HashSet();
        int sum = 0; int N = (int) (6.0/Math.log10(2));

        if(x==1 && y==1) {
            if(2<=bound){
                set.add(2);
            }
            return new ArrayList(set);
        }
        if(x==1){
            for(int i=0; i<=N; i++){
                sum = 1+(int)Math.pow(y,i);
                if(sum<=bound) set.add(sum);
            }
            return new ArrayList(set);
        }
        if(y==1){
            for(int i=0; i<=N; i++){
                sum = 1+(int)Math.pow(x,i);
                if(sum<=bound) set.add(sum);
            }
            return new ArrayList(set);
        }
        for (int i=0; i<=N; i++){
            for(int j=0; j<=N; j++){
                sum =(int)( Math.pow(x,i)+Math.pow(y,j));
                if(sum<=bound) set.add(sum);
            }
        }
        return new ArrayList(set);
    }
}

Language used for code

Java

Expected behavior

The solutions should not be accepted since it fails on the test case

Screenshots

Additional context

[lc-kay]

Hi @IgorRud
Thank you for reaching out to us. I've relayed this issue to our team to investigate.

[lc-kay]

Hi @IgorRud
Thank you for your time. We've used your feedback to update the problem. Your LeetCode account has received 100 LeetCoins as the reward for this feedback. We appreciate your support!