The smallest number which cannot be represented as the sum of any subset of the given array

__________________________________________________

**Top Companies Interview Questions..-**

Microsoft | Amazon | more.. |

If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.

__________________________________________________

### Related Posts:

- Find the Kth Smallest/Largest Element in an Array
- Print All N Length Strings from Given Number K
- Dynamic Programming – Subset Sum Problem
- Shortest Range in K-sorted Lists
- Find median of two sorted arrays of same size
- Dynamic Programming – Egg Dropping Problem
- Number of 1’s in bit representation of a number
- Separate even and odd integers in a given array
- Find the right most set bit of a number
- Dynamic Programming – Count all paths from top left to bottom right of a mXn matrix