Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
1: Brute Force We allocate an array ‘executives’ with each element 2 i.e. maximum orders supported by the i-th executives. Since each index can have 3 possible values 0, 1 and 2. The worst case complexity is O(N*M*3^M) where N is number of orders and M is number of executives. We can optimize the