Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

3055. Maximum Odd Binary Number

My accepted Python solution to LeetCode problem 3055, Maximum Odd Binary Number, running in 0ms.

  • Difficulty: Easy
  • Python
  • Runtime 0ms
  • Memory 17.3MB

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 0ms, memory 17.3MB, accepted 2025-12-29.

python
class Solution:
    def maximumOddBinaryNumber(self, s: str) -> str:
        ones = s.count('1')
        zeros = s.count('0')
        # Put ones-1 at the beginning, then all zeros, then 1 at the end
        return '1' * (ones - 1) + '0' * zeros + '1'

Source