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