Smallest Number With Given Digit Sum

Problem Statement

Smallest Number With Given Digit Sum Problem Description Write a function `solution` that, given integer N, returns the smallest non-negative integer whose individual digits sum to N. In your solution, focus on correctness. The performance of your solution will not be the focus of the assessment. Examples Example 1: Input: N = 16 Output: 79 Explanation: There are many numbers whose digits sum to 16 (for example: 79, 97, 808, 5551, 22822, etc.). The smallest such number is 79 (7 + 9 = 16). Example 2: Input: N = 19 Output: 199 Explanation: The sum of digits is 1 + 9 + 9 = 19. Example 3: Input: N = 7 Output: 7 Constraints N is an integer within the range [0..50]. Code Structure (C++) int solution(int N) { // Implement your solution here }