Combination Sum 2

• Customer Support: admin@thealgorists.com
  
• Feedback: We are listening to your every feedback, and taking action to constantly improve your learning experience. If you have any feedback, please use this form: https://thealgorists.com/Feedback.
  

---

Problem Statement:

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.
Note: The solution set must not contain duplicate combinations.

Example 1:
Input: candidates = [10,1,2,7,6,1,5], target = 8
Output:

[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]

Example 2:
Input: candidates = [2,5,2,1,2], target = 5
Output:

[
[1,2,2],
[5]
]

Solution:

• NOTE: I highly recommend going through the Backtracking chapters in the order they are given in the Index page to get the most out of it and be able to build a rock-solid understanding.

Algorithm:

This is a Premium content.
Please subscribe to the Algorithms course to access the detailed Algorithm discussion.

Java Code:

This is a Premium content.
Please subscribe to Algorithms course to access the code.

Python Code:

This is a Premium content.
Please subscribe to Algorithms course to access the code.




Don't forget to take in-depth look at the other backtracking problems because that is what would make you comfortable with using the backtracking template and master the art of Backtracking:

• Letter Case Permutation
• Power Set
• All Paths Between Two Nodes
• Word Search
• Sudoku
• N-Queens
• Word Square
• Generate Parentheses

The above content is written by:

If you have any feedback, please use this form: https://thealgorists.com/Feedback.

---

Subscribe to Our Youtube Channel

Follow Us On LinkedIn