Minimum Sum Of Four Digit Number After Splitting Digits - Leetcode Solution

Problem Statement:

You are given a four-digit number. Your task is to split the number into two two-digit numbers such that their sum is minimal. We assume that the number has exactly four digits.

Example:

Input: 3276 Output: 69 Explanation: We can split 3276 into 32 and 76. Their sum is 32 + 76 = 69, which is the minimum possible sum.

Solution:

The given problem can be solved by splitting the given four-digit number into two two-digit numbers and finding the sum of those two numbers. We can use the following steps to solve the problem:

Step 1: Convert the given four-digit number into an array of integers. We can use the following code to convert the given number into an array:

digits = [int(d) for d in str(num)]

Step 2: Find all possible two-digit splits of the given number. We can use a loop to iterate over all possible splits:

for i in range(10, 100): num1 = digits[:2] num2 = digits[2:] ...

Step 3: Calculate the sum of each split and keep track of the minimum sum:

sum = num1 + num2 if sum < min_sum: min_sum = sum

Step 4: Return the minimum sum.

Here is the complete Python solution:

def min_sum(num): digits = [int(d) for d in str(num)] min_sum = float('inf') for i in range(10, 100): num1 = digits[:2] num2 = digits[2:] sum = num1 + num2 if sum < min_sum: min_sum = sum return min_sum

print(min_sum(3276)) # Output: 69

The time complexity of this solution is O(90), which is constant and very low, so the solution is efficient.

1