Crazy hard question

[santhoshvai]

• Smallest integer greater than zero which can not be created by summing any combination of the elements of the array

Same problem??

• http://stackoverflow.com/questions/21060873/minimum-sum-that-cant-be-obtained-from-a-set
• https://www.codechef.com/JAN14/problems/FRBSUM

[prakashn27]

I find this solution to be easy:

Sort(A)
candidate = 1
for i from 1 to length(A):
   if A[i] > candidate: return candidate
   else: candidate = candidate + A[i]
return candidate

First solution is crazy. :1234: will look into it and let u know.

[santhoshvai]

I can also understand this. The challenge is to do it in less than O(n lgn). O(n) solution needed