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

#### You may also like...

### Recent Posts

- Find the first repeating character in a given string
- K-Means Algorithm
- k-Nearest Neighbors
- Find longest Snake sequence in a given matrix
- Dynamic Programming — Count all paths in 2D Matrix with Obstructions in it
- Dynamic Programming — Count all paths from top left to bottom right of a mXn matrix
- Reverse the given Array without using built in function

### Follow me on Twitter

My Tweets### Top Posts & Pages

- Reverse a Linked List
- Binary Search Tree Complete Implementation.
- All Articles
- Backtracking - N Queens Problem
- Introduction To Backtracking Programming
- Binary Min - Max Heap
- Dynamic Programming - Coin Change Problem
- Dynamic Programming - Subset Sum Problem
- Introduction To Dynamic Programming - Fibonacci Series
- Dynamic Programming - Longest Common Subsequence