#geeksforgeeks #leetcode #solution
Problem Link- [ Ссылка ]#
Given an array of digits (values are from 0 to 9), find the minimum possible sum of two numbers formed from digits of the array. All digits of given array must be used to form the two numbers.



Example 1:

Input:
N = 6
arr[] = {6, 8, 4, 5, 2, 3}
Output:
604
Explanation:
The minimum sum is formed by numbers
358 and 246
min sum of dogits
min sum formed by digits
15 july problem of the day
gfg potd
MIN sum formed by digits
adobe
atlassian
amazon
google
Min sum
MIN Formed by digits gfg problem
💓Thanks for watching.
👍If u liked this video be sure to give it a thumbs up.
🙌Want to see more? Smash that subscribe button.
Lets Connect.✨
My Linkedin Handle-[ Ссылка ]
My Github Handle-[ Ссылка ]
LeetCode & GFG Hustle- [ Ссылка ]
U can Check the Working Code in Comment Section, but first try to solve it by yourself :)
Disclaimer -
video is for educational purpose only.Copyright Disclaimer Under Section 107 of the Copyright Act 1976, allowance is made for "fair use" for purposes such as criticism, comment, news reporting, teaching, scholarship, and research. Fair use is a use permitted by copyright statute that might otherwise be infringing. Non-profit, educational or personal use tips the balance in favor of fair use
DO SUPPORT US BY LIKE SHARE AND SUBSCRIBE TO THE CHANNEL FOR MORE COURSES💥😊🙌 CODE with Rahul.

свернуть