Leetcode 1404. Number of Steps to Reduce a Number in Binary Representation to One

Given a binary string s, count the number of steps to reduce the represented number to "1" by repeatedly dividing by 2 when it's even or adding 1 when it's odd. The core challenge is to simulate these operations directly on the string—handling carry propagation on increments and trimming trailing zeros—efficiently.