Subset Sum Problem

Problem Link: https://practice.geeksforgeeks.org/problems/subset-sum-problem-1611555638/1

class Solution:
    def isSubsetSum (self, n, arr, s):
        # code here 
        
        dp=[[0 for i in range(s+1)] for j in range(n+1)]
        for i in range(n+1):
            for j in range(s+1):
                if(i==0):
                    dp[i][j]=False
                if(j==0):
                    dp[i][j]=True
                
                else:
                    if(arr[i-1]<=j):
                        inc=dp[i-1][j-arr[i-1]]
                        exc=dp[i-1][j]
                        dp[i][j]=(inc or exc)
                    else:
                        exc=dp[i-1][j]
                        dp[i][j]=exc
        
        return dp[n][s]