An HR called, explained about the position, then sent me 3 code problems that I needed to solve in 1.5 h. The problems were not so hard and feel like a LeetCode questions.

Write a function that gets a list (list1) of ints and returns a list (list2) such that:

1. Len(list1) == len(list2)
2. For every i in the list, list1[i] >= list2[i]
3. There is no duplication in list2
4. The sum of list2 is the maximum