S01E02: The Greedy Lawyer
Question:
A lawyer allows for consultancy on mondays while the clients who want to book these consultancy appointments must submit their appointment with time and duration by friday. Given that each appointment has same fees (let’s take $100), how can we pick appointments in such a way that we make the most money, i.e. maximize our revenue?
Additional Questions:
What are the different approaches we can have for picking appointments, what may be the problem with them.
What is the best approach we can take to make sure that we maximize our revenue.
Is there any approach similar to the best one, which gives the same result in terms of number of appointments, but does it also give the exact same appointments? If not then what’s the difference?
Is there any way you can prove that the best apporoach is best, i.e. there is no counter example where it fails. (hint: Discrete Maths)
How will the things be changed if the fees is not the same for appoinments, what will be the best approach then?
Coding Assignments:
Create programs to implement different approaches and compare their results.
Create visualizations and gantt chart to see and observe things.
Create a program for a problem where the fees also varies and is mensioned with the appointments from clients of the lawyer.
← Back to Season 01