| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
You are given S,X and N.
S = size of an array
N = number of elements you have to find
X = sum
You have to find N elements from the array which sum is X.
Input:
7 25 3
1 5 10 7 13 15
Output:
5 7 13
If there are multiple solution you can output any of them. What are the best possible solutions with least complexity for this problem?
Hello, I am trying to learn recursion & DP techniques. As I am very beginner in these concepts, please help me by giving some links/tutorials/videos or any resources from which I can learn these concepts from scratch to advanced level.
Thanks in advance.
