Time limit exceed

#1

getting tle for test case 0 and 1. please update my code.

#2

@pulkit_pandey09
there are some issues with initialization.also the constraints are very strict
use this logic

 dp[0][0] = true; // If sum is zero and no element is taken ans is true
    for(int i=1;i<=n;i++) { // If sum is zero ans is always true
        dp[i][0] = true;
    }
    for(int i=1;i<=target;i++) { // If no element is chosen and sum is not zero ans is false
        dp[0][i] = false;
    }
    for(int i=1;i<=n;i++) {
        for(int j=1;j<=target;j++) {
            if(j<arr[i-1]) {
                dp[i][j] = dp[i-1][j];
            } 
            if(j>=arr[i-1]) {
                dp[i][j] = dp[i-1][j] or dp[i-1][j-arr[i-1]];
            }
        }
    }
    return dp[n][target];