Perhaps what is meant is "maximize the difference between the optimal result and... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		zahlman 71 days ago \| parent \| context \| favorite \| on: Many hard LeetCode problems are easy constraint pr... Perhaps what is meant is "maximize the difference between the optimal result and the one calculated by the naive greedy algorithm".

Jun8 71 days ago [–]

Thanks for clarifying my poorly worded description, that’s exactly what I meant. Like in the example given, the difference is 10-4=6, let’s call this the naive_greedy_miss_factor. Can we choose three other denominations so that NGMF is > 6?

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact