Bit matching challenge

In Progress

Ea$$y

Write a program to determine the number of bits in the binary number

that must be changed to accurately represent the given decimal

number in binary format. The input consists of an array of strings

containing exactly two elements; the first element is a positive

decimal number, and the second element is a binary number. The

output should be an integer representing the minimum number of bit

flips required to match the binary representation of the decimal

number.

Input Format

An array of strings, strArr $,$ containing two elements:

The first element is a positive decimal number within the

range $1$ decimal $2^{31}-1.$

The second element is a binary number, represented as a

string of $1$ to $32$ characters. This binary string represents the

decimal number with or Without leading zeros.

Output Format

An integer representing the minimum number of bit flips $(0$ to $1$ or

$1$ to $0)$ required to match the binary representation of the decimal

number.

Example Input

$56011000$