I thought of a solution but I have a doubt if my solution will work.
Please tell your solution of solving it, also a little analysis of the time complexity(if you have time)
Here is the problem: Click Me
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Please help in this interview problem
I thought of a solution but I have a doubt if my solution will work.
Please tell your solution of solving it, also a little analysis of the time complexity(if you have time)
Here is the problem: Click Me
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | saint_coder | 2019-06-19 11:27:07 | 2 | Tiny change: 'straints\n1<=N<=20' -> 'straints\n\n1<=N<=20' | ||
en3 | saint_coder | 2019-06-19 11:22:41 | 770 | Tiny change: '=N<=2000\n1<=A[i],' -> '=N<=2000\n\n1<=A[i],' | ||
en2 | saint_coder | 2019-06-19 09:32:49 | 66 | |||
en1 | saint_coder | 2019-06-19 09:31:10 | 268 | Initial revision (published) |
Name |
---|