Given an integer array arr, sort the integers in ascending order based on the number of $1$’s in their binary representation. If multiple integers share the same count of $1$’s, sort them in ascending numerical order.

Return the sorted array.

Constraints:

• $1 \leq$ arr.length $\leq 500$

• $0 \leq$ arr[i] $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.