07 Minimum Not Possible Number by SubSet Sum | Array Problem | O(n) | DSA | Solution With Code

Given a sorted array arr[] of positive integers, find the smallest positive integer such that it cannot be represented as the sum of elements of any subset of the given array set.

Input: arr[] = [1, 2, 3]
Output: 7
Explanation: 7 is the smallest positive number for which no subset is there with sum 7.

00:00 RECAP
00:30 Understanding the Problem with Example
03:10 Optimized Solution - Optimized Algorithm O(n)
08:40 C++ Implementation of above Algorithms
09:10 Code Execution for multiple Use Cases
10:00 Thank you

Comment if you need Complete Code link ...