1
00:00:00,080 --> 00:00:06,770
In this video, let's get started with a famous coding interview question called Combination Sum one.

2
00:00:07,250 --> 00:00:16,250
The question reads given an array of distinct integers, which is called candidates and a target integer

3
00:00:16,250 --> 00:00:24,710
target, return a list of all unique combinations of candidates where the chosen numbers sum to target.

4
00:00:24,920 --> 00:00:28,220
You may return the combinations in any order.

5
00:00:28,220 --> 00:00:35,900
The same number may be chosen from candidates, and unlimited number of times two combinations are unique.

6
00:00:35,900 --> 00:00:41,960
If the frequency of at least one of the chosen numbers is different, you will not be given an empty

7
00:00:41,960 --> 00:00:42,950
candidates array.

8
00:00:42,950 --> 00:00:46,850
So this array which is given to us has the name candidates.

9
00:00:46,850 --> 00:00:48,050
So that's given over here.

10
00:00:48,050 --> 00:00:50,600
And we are also given a target value.

11
00:00:50,600 --> 00:00:59,000
And as is given in the example over here, we have to return an array of arrays where each element is

12
00:00:59,000 --> 00:01:04,400
a combination of the numbers in the candidates array which adds up to the target value.

13
00:01:04,400 --> 00:01:10,850
For example, you have two, three, six, seven and two plus two plus three is equal to seven.

14
00:01:10,850 --> 00:01:13,490
And again notice we have taken two two times.

15
00:01:13,670 --> 00:01:19,790
That's because in the question it says that the same number may be chosen from candidates and unlimited

16
00:01:19,790 --> 00:01:20,690
number of times.

17
00:01:20,690 --> 00:01:27,650
So this is the question and I would highly encourage you to take some time and try to solve this question

18
00:01:27,650 --> 00:01:28,520
on your own.

19
00:01:28,520 --> 00:01:31,220
Before you go ahead and take a look at the approach video.