Why is the minimum number of steps 2 when Number of 1’s in A (cnt_A) > Number of 1’s in B-1 (cnt_B):
For example in the following testcase:
A: 14, B: 12
Only one operation is required as follows - Binary A: 1110; Shuffle to make: 1011; Add 1 : 1100 which is 12 equal to B.
The Algo according to editorial (including code linked by l_returns) produces 2 as output. Whereas as seen above minimum number of operations required is 1.
Can anybody explain ?