baka_'s blog

Tricks or best approaches for greedy(ad-hoc) problems?
By baka_, history, 3 years ago, In English

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?

 
 
 
 
  • Vote: I like it
  • -3
  • Vote: I do not like it

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

tell me if you get the effective answer lol

→ Reply
»
6 weeks ago, # |
  Vote: I like it +2 Vote: I do not like 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

→ Reply