<awangdev>416. Partition Equal Subset Sum_3.java
public boolean dfs(int[] nums, int index, int target) {
        if (index == nums.length) return false;
        if (target == nums[index]) return true;
        if (target < nums[index]) return false;
        return dfs(nums, index + 1, target - nums[index]) 
            || dfs(nums, index + 1, target);
    }
public boolean sample_funcname ( int [ ] nums , int index , int target ) {
  if ( index == nums . length ) return false ;
  if ( target == nums [ index ] ) return true ;
  if ( target < nums [ index ] ) return false ;
  return dfs ( nums , index + 1 , target - nums [ index ] ) || dfs ( nums , index + 1 , target ) ;
}
