Sum of Subset Problem Using Backtracking - Design and Analysis of Algorithms
Sundeep Saradhi Kanthety via YouTube
Learn Generative AI, Prompt Engineering, and LLMs for Free
Master AI and Machine Learning: From Neural Networks to Applications
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Learn how to solve the Sum of Subset problem using backtracking in this Design and Analysis of Algorithms video tutorial. Explore the step-by-step process of implementing the backtracking algorithm to find subsets of a given set that sum up to a target value. Gain a deep understanding of the problem-solving approach, including the construction of the solution space tree and the pruning techniques used to optimize the search. Follow along with a detailed example that demonstrates the algorithm's execution, helping to solidify your grasp of this important concept in algorithm design and analysis.
Syllabus
SUM OF SUBSET PROBLEM USING BACKTRACKING WITH EXAMPLE || DESIGN AND ANALYSIS OF ALGORITHMS || DAA
Taught by
Sundeep Saradhi Kanthety