Hello
I want to try training by reading hard problems and then reading their editorial immediately and implementing them did anyone try this training approach before.
# | User | Rating |
---|---|---|
1 | Radewoosh | 3759 |
2 | orzdevinwang | 3697 |
3 | jiangly | 3662 |
4 | Benq | 3644 |
5 | -0.5 | 3545 |
6 | ecnerwala | 3505 |
7 | tourist | 3486 |
8 | inaFSTream | 3478 |
9 | maroonrk | 3454 |
10 | Rebelz | 3415 |
# | User | Contrib. |
---|---|---|
1 | adamant | 173 |
2 | awoo | 167 |
3 | SecondThread | 163 |
4 | BledDest | 162 |
4 | Um_nik | 162 |
6 | maroonrk | 161 |
6 | nor | 161 |
8 | -is-this-fft- | 150 |
9 | Geothermal | 146 |
10 | TheScrasse | 143 |
Hello
I want to try training by reading hard problems and then reading their editorial immediately and implementing them did anyone try this training approach before.
Hello I have a question if I have a tree with n nodes and all nodes have some value there are two types of queries
what is the max node value in the path (u,v)
update u to be equal to x
I think HLD can solve this problem but I want to know if there is other ways or techniques that can solve a problem like this
Thank you
edit:
Why does eveybody keep downvoting I just had a question
I want to make a challenge for myself I want to reach candidate master in the next 2 months can you tell me an advice to make a plan to improve quickly
thank you
I try to be better in dp and saw so much videos and I am still not good in dp I try to solve problems but I find it hard to come up with a dp solution
Name |
---|