Leetcode Problem 868. Binary Gap

868. Binary Gap

Leetcode Solutions

Initialize last to -1, which will hold the index of the last seen 1.
Initialize maxDistance to 0, which will hold the maximum distance found.
Iterate through each bit of n from right to left (least significant bit to most significant bit).
For each bit, increment an index i starting from 0.
If the current bit is 1, check if last is not -1 (which means this is not the first 1 found).
If it's not the first 1, update maxDistance with the maximum of maxDistance and i - last.
Update last to the current index i.
After the loop, return maxDistance as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen