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?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 156 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | orz | 144 |
9 | pajenegod | 144 |
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?
Название |
---|
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!