Sample test cases are passing but test cases are failing

#1

package com.algo.recursion;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class BinaryString {

public static void main(String[] args) throws IOException {
    BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
    int t = Integer.parseInt(bufferedReader.readLine());
    for (int i = 0; i < t; i++) {
        int num = Integer.parseInt(bufferedReader.readLine());
        System.out.println(countBinaryStrings(num));

    }
}

private static int countBinaryStrings(int k) {
    int[] endwithZero = new int[k];
    int[] endWithOne = new int[k];
    endWithOne[0] = 1;
    endwithZero[0] = 1;
    for (int i = 1; i < k; i++) {
        endwithZero[i] = endWithOne[i - 1] + endwithZero[i - 1];
        endWithOne[i] = endwithZero[i - 1];
    }
    return endWithOne[k - 1] + endwithZero[k - 1];
}

}

Could you please tell me what is wrong with my program

#2

use long instead of int and you will get AC.
If you see the pattern, the n+2(th) fibonacci number is the number of distinct binary strings with no consecutive 1’s.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.