Coding round: Similar to schedular problem. There are list of tasks each has some time to complete and there are list of employess with skill set. Each employee has x time to work for a day. Find to minimum number of employees to complete all tasks
第三轮
Given list of integer arrays(duplicates are possible). Print the K maximum values.
for example:
Input: {3,2,1,4,5} K =2
Output: 5,4
Input: {3,2,5,1,5} k= 2
output: 5