PROBLEM OF THE DAY : 09/11/2024 | Minimum Sum

Welcome to the daily solving of our PROBLEM OF THE DAY with Geetesh Yadav We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Arrays but also build up problem-solving skills.

Given an array arr[] such that each element is in the range [0 - 9], find the minimum possible sum of two numbers formed using the elements of the array. All digits in the given array must be used to form the two numbers. Return a string without leading zeroes.

Examples :

Input: arr[] = [6, 8, 4, 5, 2, 3] Output: 604 Explanation: The minimum sum is formed by numbers 358 and 246.
 

Give the problem a try before going through the video. All the best!!!
Problem Link: https://www.geeksforgeeks.org/problems/minimum-sum4058/1