1323## - Maximum 69 Number

[Eliran-Turgeman]

Description of the Problem

Given a positive integer num consisting only of digits 6 and 9.

Return the maximum number you can get by changing at most one digit (6 becomes 9, and 9 becomes 6).

Example 1:

Input: num = 9669
Output: 9969
Explanation:
Changing the first digit results in 6669.
Changing the second digit results in 9969.
Changing the third digit results in 9699.
Changing the fourth digit results in 9666.
The maximum number is 9969.
Example 2:

Input: num = 9996
Output: 9999
Explanation: Changing the last digit 6 to 9 results in the maximum number.
Example 3:

Input: num = 9999
Output: 9999
Explanation: It is better not to apply any change.

Constraints:

1 <= num <= 10^4
num's digits are 6 or 9.

Code

class Solution:
    def maximum69Number (self, num: int) -> int:
        num_arr = [digit for digit in str(num)]
        try:
            num_arr[num_arr.index('6')] = '9'
        except ValueError:
            pass
        return int(''.join(num_arr))

Link To The LeetCode Problem

LeetCode

[Harsh-Udai]

@DevEliran can you assign me this

[HarlockOfficial]

@DevEliran can you assign this to me please?

[sanujana045]

I want to do this

[vJechsmayr]

@DevEliran Do you work on that Issue on your own?

[Sounakde]

@DevEliran Can you assign me to this issue?

[Eliran-Turgeman]

@vJechsmayr Yes, I would like to

[bhartish]

@DevEliran please assign this problem to me.

[Shivansh-Malhotra]

@DevEliran i think i can solve it, please assign this to me.

[Curious-Ujjwal]

Hey @vJechsmayr , I think I can solve this issue. Can you assign it to me, if it is open.

[flick-23]

Please assign this to me. I will do it!