Consider a set of jobs, each having its deadlines and process time. How to find a permutation of them such that if they are executed in that sequence, they all finish before their deadline
or figure out that no such permutation exists.
My Thoughts:
There could be some greedy strategy, but I am not sure how to arrive at that.