Let
a = [9 9 9 9 9 9 8 8 8 8 7 7 7 6 6 6 5 5 4 2 1] b = [1 1 1 3 3 3 3 3 4 4 4 4 4 10 10 10]
Output should be
[9 8 7 6 5 4 2 1 3 10]
I think the description and test suite on this problem is slightly off. When I see 'union' I already assume that no duplicates are permitted and order is irrelevant.
Given an unsigned integer x, find the largest y by rearranging the bits in x
476 Solvers
570 Solvers
234 Solvers
Area of an equilateral triangle
1501 Solvers
168 Solvers