Combination Sum 2

Algorithms and Data Structures: TheAlgorist.com
System Design: SystemsDesign.Cloud
Low Level Design: LowLevelDesign.io
Frontend Engineering: FrontendEngineering.io

Problem Statement:

Given an array of integer numbers and a target number, find all unique combinations in the array where the numbers sum to target.
Each number in the given array may only be used once in the combination.
Your result cannot contain any duplicate combinations.

Examples:
Input = [10,1,2,7,6,1], target = 8
Output:

[
[1,1,6],
[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:

Instructor:

Abhishek Dey

Senior SDE | Chief Architect

Microsoft | University of Florida

View LinkedIn profile

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