comefrom: <awangdev>698. Partition to K Equal Sum Subsets_1.java
code: private boolean dfs(Queue<Integer> queue, int size, int k, int sum, int target) {
  
          if (k == 0) return true; 
          if (sum == target) return dfs(queue, queue.size(), k - 1, 0, target);
          
          while (size-- > 0) {
              int num = queue.poll();
              if (sum + num <= target && dfs(queue, size+1, k, sum + num, target)) return true;
              queue.offer(num);
          }
          return false;
      }
masked: private boolean sample_funcname ( Queue < Integer > queue , int size , int k , int sum , int target ) {
    if ( k == 0 ) return true ;
    if ( sum == target ) return dfs ( queue , queue . size ( ) , k - 1 , 0 , target ) ;
    while ( size -- > 0 ) {
      int num = queue . poll ( ) ;
      if ( sum + num <= target && dfs ( queue , size + 1 , k , sum + num , target ) ) return true ;
      queue . offer ( num ) ;
    }
    return false ;
  }
  