Find longest sequence of 1’s in binary representation with one flip

gistfile1.txt

"""
https://www.geeksforgeeks.org/find-longest-sequence-1s-binary-representation-one-flip/

Input : 1775
Output : 8
Binary representation of 1775 is 11011101111.
After flipping the highlighted bit, we get
consecutive 8 bits. 11011111111.

Input : 12
Output : 3

Input : 15
Output : 5

Input : 71
Output: 4

Binary representation of 71 is 1000111.
After flipping the highlighted bit, we get
consecutive 4 bits. 1001111.
"""


def longest_sequence(input_):
    input_ = bin(input_).strip('0b')
    boundaries = input_.split('0')
    if len(boundaries) > 1:
        longest_subsequence = len(boundaries[-1]) + len(boundaries[-2]) + 1
    else:
        longest_subsequence = len(boundaries[-1]) + 1
    return longest_subsequence


def main():
    for entry in [1775, 12, 15, 71]:
        print(f"Longest subsequence of 1's in {entry} is {longest_sequence(entry)}")


if __name__ == '__main__':
    main()