Smallest Positive Integer that can not be represented as Sum |Maths-10| Placement Preparation Series

[@yashkhatwani3198]

In simple words
# if the current number is greater than ans , than ans can never be formed simply return it
# else we can form answer till ans+ arr[i] as everything between it can be formed

[@BroCoders]

This is the focus with which one should watch video....great!!

[@ArnabJhaYT]

long long smallestpositive(vector arr, int n)
{
sort(arr.begin(), arr.end());
long long curr = arr[0];
if(arr[0] != 1)
return 1;
for(int i = 1; i curr+1)
return curr+1;
curr += arr[i];
}
return curr+1;
}
TC - NLOGN
SC - 1

[@arghya_0802]

The video is exceptionally good!! Itna achhe se question samjhaye Karan sir ne!! Intuition bhi samajh aa gaya aur code to cake-walk tha.
Summary:
1. Sort the array so that we move in sequence
2. Iterate from i = 0 till N
3. ans = 1. If we find any number in array which is greater than ans, we return it
4. Else we add the number to the ans
5. At the end, we return ans if we traverse the complete array.
Intuition:
If nums[i] ans, we cannot form it using the the elements we have encountered till now, so smallest positive is our ans only

[@yourbestie4138]

Wow , such a nice explanation

[@BroCoders]

Thanks a lot 😊

[@naman120]

Very Good Solution Approach

[@BroCoders]

Thanks!!

[@Gaurav_kumar_mgk]

great explaination

[@BroCoders]

Thanks Gaurav!!
Do share among your friends!!

[@krishnavar7219]

how you said time complexity of it...i got understand

[@uknowme48]

day 3 problem 1

[@BroCoders]

Hope you reach to very end!!

[@RAHULCHOUDHARY-ij2pt]

thanks bro

[@BroCoders]

Welcome

[@ArnabJhaYT]

great intuition. Thanks, brother.

[@BroCoders]

Welcome!!!

[@ashvinkumhar5819]

respect++

[@BroCoders]

Thanks!!