> come up with simple ones on your own, like a greedy one.
Greedy alogrithms are simple to come up with in an interview, Yes. But they are often wrong and even if they are right there is no way to know that, unless you construct a mathematical proof.
I would highly advice not using greedy in an interview since coming up with a solid proof in 15 mins is not really possible in all but simple cases.
Greedy alogrithms are simple to come up with in an interview, Yes. But they are often wrong and even if they are right there is no way to know that, unless you construct a mathematical proof.
I would highly advice not using greedy in an interview since coming up with a solid proof in 15 mins is not really possible in all but simple cases.