arrow_back Back to Challenges

#40 Combination Sum II

Medium Acceptance 0%
description

Problem Description

Given a collection of candidate numbers (`candidates`) and a target number (`target`), find all unique combinations in `candidates` where the candidate numbers sum to `target`. Each number in `candidates` may only be used once in the combination.

checklist Constraints

See problem description for detailed constraints.

science Examples

Case #1

In: # See problem description for input format
Out: # Expected output

Mastery Tags

Arrays Backtracking

Hiring Companies

Meta Salesforce
code

Integrated IDE

code_blocks
Coding
psychology
Aptitude