Greedy algorithms make locally optimal choices hoping for a global optimum. Easy greedy problems have obvious choices. Hard greedy problems require proving that local choices lead to global optimality.
Your challenge isn't implementation. It's convincing yourself (and your interviewer) that greedy works. Without a proof sketch, you're just guessing. Exchange arguments and staying ahead proofs are your tools.
