#3750

Minimum Number of Flips to Reverse Binary String

newbie · 230 · lc easy +17 · 75.9% accepted · 35 likes · top 87%

⚑ Converging Pointers (Pair / Triple Sum)

Description

Given a positive integer n whose binary representation (without leading zeros) is s, return the minimum number of bit flips required so that s becomes equal to its own reverse.

Code

1

2

3

class Solution:
    def minimumFlips(self, n: int) -> int:

class Solution:
    def minimumFlips(self, n: int) -> int: