Hi! I'm looking for the best approaches to finding a solution to greedy (let's say 1800+ difficulty) problems. Are there any implementation tricks worth it to know? How can I find the correct solution faster and eventually be able to prove it?
# | User | Rating |
---|---|---|
1 | tourist | 3771 |
2 | jiangly | 3688 |
3 | Um_nik | 3539 |
4 | slime | 3498 |
5 | djq_cpp | 3486 |
6 | MiracleFaFa | 3466 |
7 | ksun48 | 3452 |
8 | Radewoosh | 3406 |
9 | greenheadstrange | 3393 |
10 | xtqqwq | 3382 |
# | User | Contrib. |
---|---|---|
1 | -is-this-fft- | 183 |
2 | awoo | 181 |
3 | YouKn0wWho | 177 |
4 | Um_nik | 175 |
5 | dario2994 | 172 |
6 | Monogon | 171 |
7 | adamant | 168 |
7 | maroonrk | 168 |
9 | antontrygubO_o | 166 |
10 | errorgorn | 164 |
Hi! I'm looking for the best approaches to finding a solution to greedy (let's say 1800+ difficulty) problems. Are there any implementation tricks worth it to know? How can I find the correct solution faster and eventually be able to prove it?
Name |
---|
tell me if you get the effective answer lol
Many times greedy problems use sorting or priority queue .Also u can try to relate the problems with some standard greedy problems like:- (1) Minimum number of platforms. (2) Meeting Rooms 1 and meeting rooms2 in leetcode (3) Coin change problem (4) Gas station on leetcode or expedi problem on spoj (5) Fractional Knapsack (6) Activity scheduling (7) Merge intervals
3 years later, this guy got an answer!
What a lucky guy!