4126. Minimum Number of Flips to Reverse Binary String
My accepted Python solution to LeetCode problem 4126, Minimum Number of Flips to Reverse Binary String, running in 3ms.
- Difficulty: Easy
- Python
- Runtime 3ms
- Memory 17.2MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 3ms, memory 17.2MB, accepted 2025-12-31.
class Solution:
def minimumFlips(self, n: int) -> int:
s = bin(n)[2:]
rev = s[::-1]
# Count positions where s differs from rev
return sum(1 for i in range(len(s)) if s[i] != rev[i])