About this document
Dynamic Programming: Subset Sum Problem by Uttam Singh is a document available to read on EtoBox.
The document discusses the subset sum problem and two approaches to solve it - a recursive solution and a dynamic programming solution. The subset sum problem is to determine if there exists a subset of a given set of numbers that sums to a given number. The recursive solution recursively checks all possible subsets but has exponential time complexity. The dynamic programming solution builds a 2D table in bottom-up manner to store solutions, checking if the sum can be achieved using numbers from index 0 to
- Author
- Uttam Singh
- Language
- EN