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

### Recent Posts

- Number of bit to be flipped to convert one number to another.
- Separate even and odd integers in a given array
- Find three elements in an array that sum to a zero.
- All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space
- Separate 0’s and 1’s in a given array
- Find local minimum or local maximum in O(1).
- Find three elements in an array that sum to a given value

### Follow me on Twitter

My Tweets### Top Posts & Pages

- Reverse a Linked List
- Binary Search Tree Complete Implementation.
- Dynamic Programming - Coin Change Problem
- All Articles
- Backtracking - N Queens Problem
- Dynamic Programming - Subset Sum Problem
- Binary Min - Max Heap
- Inorder Predecessor and Successor in Binary Search Tree
- Introduction To Backtracking Programming
- Dynamic Programming - Minimum Coin Change Problem