Given an integer array nums and an integer m, where each element in nums is represented as an $m$ bit binary string.

The Hamming distance between two binary representations of length $m$ is defined as the number of bit positions in which they differ.

Return an array ans of the same length as nums, where ans[i] is the maximum Hamming distance between nums[i] and any element in nums.

Constraints:

• $1 \leq$ m $\leq 17$

• $2 \leq$ nums.length $\leq 2^{ {`m`}}$

• $0 \leq$ nums[i] $< 2^{ {`m`}}$

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.