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 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | 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 |
---|