In this video, let's get started with a famous coding interview question called Combination Sum one.
The question reads given an array of distinct integers, which is called candidates and a target integer
target, return a list of all unique combinations of candidates where the chosen numbers sum to target.
You may return the combinations in any order.
The same number may be chosen from candidates, and unlimited number of times two combinations are unique.
If the frequency of at least one of the chosen numbers is different, you will not be given an empty
candidates array.
So this array which is given to us has the name candidates.
So that's given over here.
And we are also given a target value.
And as is given in the example over here, we have to return an array of arrays where each element is
a combination of the numbers in the candidates array which adds up to the target value.
For example, you have two, three, six, seven and two plus two plus three is equal to seven.
And again notice we have taken two two times.
That's because in the question it says that the same number may be chosen from candidates and unlimited
number of times.
So this is the question and I would highly encourage you to take some time and try to solve this question
on your own.
Before you go ahead and take a look at the approach video.