Yahoo India Web Search

Search results

1. www.geeksforgeeks.org › subset-sum-problem-dp-25Dynamic Programming - Subset Sum Problem - GeeksforGeeks

   www.geeksforgeeks.org › subset-sum-problem-dp-25

   • Cached

   Apr 23, 2024 · Learn how to solve the subset sum problem using dynamic programming techniques. See examples, algorithms, and code implementations in C++, Java, Python, C#, Javascript, and PHP.

   • Subset Sum Problem | Practice | GeeksforGeeks

     Given an array of non-negative integers, and a value sum,...

   • Subset Sum Problem using Backtracking - GeeksforGeeks

     Subset Sum Problem using Backtracking. Subset sum can also...

2. www.geeksforgeeks.org › problems › subset-sumSubset Sum Problem | Practice | GeeksforGeeks

   www.geeksforgeeks.org › problems › subset-sum

   • Cached

   Learn how to solve the subset sum problem using dynamic programming. Given an array of non-negative integers and a sum, find if there is a subset with that sum. See examples, code and complexity analysis.

3. www.javatpoint.com › subset-sum-problemsSubset Sum Problems - javatpoint

   www.javatpoint.com › subset-sum-problems

   • Cached

   Learn what is the subset sum problem, a classic NP-complete problem in complexity theory. See how to solve it using recursion and dynamic programming with examples and code.

4. en.wikipedia.org › wiki › Subset_sum_problemSubset sum problem - Wikipedia

   en.wikipedia.org › wiki › Subset_sum_problem

   • Cached

   The subset sum problem (SSP) is a decision problem in computer science. In its most general formulation, there is a multiset of integers and a target-sum , and the question is to decide whether any subset of the integers sum to precisely . [1] The problem is known to be NP-complete. Moreover, some restricted variants of it are NP-complete too ...

5. www.geeksforgeeks.org › subset-sum-problemSubset Sum Problem using Backtracking - GeeksforGeeks

   www.geeksforgeeks.org › subset-sum-problem

   • Cached

   Dec 4, 2023 · Subset Sum Problem using Backtracking. Subset sum can also be thought of as a special case of the 0–1 Knapsack problem. For each item, there are two possibilities: Include the current element in the subset and recur for the remaining elements with the remaining Sum. Exclude the current element from the subset and recur for the remaining ...

6. www.interviewbit.com › blog › subset-sum-problemSubset Sum Problem (With Solution) - InterviewBit

   www.interviewbit.com › blog › subset-sum-problem

   • Cached

   Jun 15, 2022 · Learn how to solve the subset sum problem using recursion and dynamic programming. See examples, code implementations, time and space complexity, and practice questions.

7. People also ask

   What is sum of subsets problem?

   • In the sum of subsets problem, there is a given set with some non-negative integer elements. And another sum value is also provided, our task is to find all possible subsets of the given set whose sum is the same as the given sum value. Set: In mathematical terms, a set is defined as a collection of similar types of objects.

   Subset Sum Problem - Online Tutorials Library

   www.tutorialspoint.com/data_structures_algorithms/subset_sum_problem.htm

   See all results for this question

   How to solve SUBSET SUM problem using dynamic programming?

   • Let A be an array or set which contains 'n' non-negative integers. Find a subset 'x' of set 'A' such that the sum of all the elements of x is equal to w where x is another input (sum). Now we have to find out the subset from the given set whose sum is equal to 18. Here we will use the dynamic programming approach to solve the subset sum problem.

   Subset Sum Problems - javatpoint

   www.javatpoint.com/subset-sum-problems

   See all results for this question

   What is a subset sum?

   • Subset sum can also be thought of as a special case of the 0–1 Knapsack problem. For each item, there are two possibilities: Include the current element in the subset and recur for the remaining elements with the remaining Sum. Exclude the current element from the subset and recur for the remaining elements.

   Subset Sum Problem using Backtracking - GeeksforGeeks

   www.geeksforgeeks.org/subset-sum-problem/

   See all results for this question

   Is the sum of a subset equal to 9?

   • For example, the set is given as [5, 2, 1, 3, 9], and the sum of the subset is 9; the answer is YES as the sum of the subset [5, 3, 1] is equal to 9. This is an NP-complete problem again. It is the special case of knapsack Let's understand this problem through an example. problem. We want to find out the subset whose sum is equal to 5.

   Subset Sum Problems - javatpoint

   www.javatpoint.com/subset-sum-problems

   See all results for this question

8. www.tutorialspoint.com › subset_sum_problemSubset Sum Problem - Online Tutorials Library

   www.tutorialspoint.com › subset_sum_problem

   • Cached

   Learn how to solve the subset sum problem using backtracking approach. Find all possible subsets of a given set whose sum is equal to a given value. See C, C++ and Java code examples.