Bytedance OA questions
Anonymous User
938

Given hours k and meetings with a length in hours and priority score

Find the maximum proierty score you can achieve by you can attending meetings within k

ex
k = 3
meetings = [[1,200],[2,400],[4,400],[3,100]]

output: 600 (meetings[0] + meetings[1]= 600)

ex
k = 6
meetings = [[1,200],[2,400],[4,400],[2,100],[5,500]]

output: 800 (meetings[1] + meetings[2]= 800)

Comments (3)