parameters: (candidates, target)
return_statement: return result_set
docstring: Problem description:
  
      Given a set of candidate numbers (C) (without duplicates) and a target number (T), 
      find all unique combinations in C where the candidate numbers sums to T.
  
      The same repeated number may be chosen from C unlimited number of times.
      
      Args:
          candidates: list of pickable integers
          target: target sum
  
      Returns:
          List of subsets that sum to the target sum of target
docstring_summary: Problem description:
docstring_tokens: Problem description :
function: def combinationSum(candidates, target):
      """
      Problem description:
  
      Given a set of candidate numbers (C) (without duplicates) and a target number (T), 
      find all unique combinations in C where the candidate numbers sums to T.
  
      The same repeated number may be chosen from C unlimited number of times.
      
      Args:
          candidates: list of pickable integers
          target: target sum
  
      Returns:
          List of subsets that sum to the target sum of target
      """
      result_set = []
      backtrack(0, sorted(candidates), target, 0, result_set, [])
      return result_set
function_tokens: def combinationSum ( candidates , target ) : result_set = [ ] backtrack ( 0 , sorted ( candidates ) , target , 0 , result_set , [ ] ) return result_set