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.
Topics
Companies
Articles
Examples:
Expected Time Complexity: O(n log n)
Expected Auxiliary Space: O(n)
Constraints:
1 <= arr.size() <= 10^6
0 <= arr[i] <= 9
Companies:
AdobeGoogleGoldman Sachs
Topics:
ArraySorting Algorithms
Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.
Please log in to access the Solution tab and view detailed answers and explanations.
Please log in to access the Discussion tab and join conversations with other participants.
Access Restricted: Please Login to access the code editor and test cases.