Problem Submissions Solution
Minimum sum
Difficulty: Medium
Acceptance: %
Points: 30.00
Given an array arr[] where each element is in the range [0, 9], the task is to find the minimum possible sum of two numbers that can be formed using the elements of the array. All digits in the array must be used to form the two numbers. The result should be returned as a string without leading zeros.
Examples:
Expected Time Complexity: O(n log n)
Expected Auxiliary Space: O(n)
Constraints:
- 1 <= arr.size() <= 10^6
- 0 <= arr[i] <= 9
Companies:
Adobe Google Goldman Sachs
Topics:
Array Sorting Algorithms
