L-5.5: Sum of Subsets Problem | Dynamic Programming

The Sum of problem involves determining whether or not a subset from a list of integers can sum to a target value. For example, consider the list of nums = [1, 2, 3, 4]. If the target = 7, there are two subsets that achieve this sum: {3, 4} and {1, 2, 4}. If target = 11, there are no solutions. In this video, Varun sir will explain about sum of subsets problems in detail. -------------------------------------------------------------------------------------------------------------------------------------- Timestamps: 0:00 - Sum of Subset Problem 4:37 - Recursive Equation 9:25 - Evaluation of Recursive Equation -------------------------------------------------------------------------------------------------------------------------------------- 🔹 Gate Smashers Shorts: Watch quick concepts & short videos here:    / @gatesmashersshorts   🔹 Subscribe for more shorts and motivational content:    / @varunainashots   👉Links for DAA Notes: đź”—File-1: https://rb.gy/2byrg 🧑‍🎓Contributed by: Junaid Gazi đź”—File-2: 🧑‍🎓Contributed by: Mannu Garg â–şDesign and Analysis of algorithms (DAA) (Complete Playlist):    • Design and Analysis of algorithms (DAA)   Other subject-wise playlist Links: -------------------------------------------------------------------------------------------------------------------------------------- â–ş Operating System :    • Operating System (Complete Playlist)   â–şDatabase Management System:    • DBMS (Database Management system) Complete...   â–ş Theory of Computation    • TOC(Theory of Computation)   â–şArtificial Intelligence:    • Artificial Intelligence (Complete Playlist)   â–şComputer Networks (Complete Playlist):    • Computer Networks (Complete Playlist)   â–şComputer Architecture (Complete Playlist):    • Computer Organization and Architecture (Co...   â–şStructured Query Language (SQL):    • Structured Query Language (SQL)   â–şDiscrete Mathematics:    • Discrete Mathematics   â–şCompiler Design:    • Compiler Design (Complete Playlist)   â–şNumber System:    • Number system   â–şCloud Computing & BIG Data:    • Cloud Computing (Complete Course)   â–şSoftware Engineering:    • Software Engineering   â–şData Structure:    • Data Structure   â–şGraph Theory:    • Graph Theory   â–şProgramming in C:    • C Programming   â–şDigital Logic:    • Digital Logic (Complete Playlist)   --------------------------------------------------------------------------------------------------------------------------------------- Our social media Links: â–ş Subscribe to us on YouTube:    / gatesmashers   â–şSubscribe to our new channel:    / @varunainashots   â–ş Like our page on Facebook:   / gatesmashers   â–ş Follow us on Instagram:   / gate.smashers   â–ş Follow us on Instagram:   / varunainashots   â–ş Follow us on Telegram: https://t.me/gatesmashersofficial â–ş Follow us on Threads: https://www.threads.net/@gate.smashers -------------------------------------------------------------------------------------------------------------------------------------- â–şFor Any Query, Suggestion or notes contribution: Email us at: [email protected]

L-5.6: Multistage Graph | Dynamic Programming
▶︎

L-5.6: Multistage Graph | Dynamic Programming

6.2 Sum Of Subsets Problem - Backtracking
▶︎

6.2 Sum Of Subsets Problem - Backtracking

L-5.8: Floyd Warshall Working with example | All Pair Shortest Path Algorithm
▶︎

L-5.8: Floyd Warshall Working with example | All Pair Shortest Path Algorithm

Sum of Subsets problem using backtracking 🔥
▶︎

Sum of Subsets problem using backtracking 🔥

L-5.3: 0/1 Knapsack Problem |Dynamic Programming |Recursive Equation |Recursion Tree Time Complexity
▶︎

L-5.3: 0/1 Knapsack Problem |Dynamic Programming |Recursive Equation |Recursion Tree Time Complexity

L-5.4: Traveling Salesman Problem | Dynamic Programming
▶︎

L-5.4: Traveling Salesman Problem | Dynamic Programming

Sum of Subset Problem Using Backtracking || Backtracking Algorithm || DAA
▶︎

Sum of Subset Problem Using Backtracking || Backtracking Algorithm || DAA

Traveling Salesman Problem using Dynamic Programming | DAA
▶︎

Traveling Salesman Problem using Dynamic Programming | DAA

Sum Of Subsets Problem in Back Tracking - Method, Example |L-13||DAA|
▶︎

Sum Of Subsets Problem in Back Tracking - Method, Example |L-13||DAA|

L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method
▶︎

L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

Subset Sum Problem using Dynamic Programming | Data Structures and Algorithms
▶︎

Subset Sum Problem using Dynamic Programming | Data Structures and Algorithms

Lec-41: Branch & Bound Algorithm with Example | Easiest Explanation of B&B with example
▶︎

Lec-41: Branch & Bound Algorithm with Example | Easiest Explanation of B&B with example

5 Simple Steps for Solving Any Recursive Problem
▶︎

5 Simple Steps for Solving Any Recursive Problem

L-4.2: Knapsack Problem With Example| Greedy Techniques| Algorithm
▶︎

L-4.2: Knapsack Problem With Example| Greedy Techniques| Algorithm

Mastering Dynamic Programming - How to solve any interview problem
▶︎

Mastering Dynamic Programming - How to solve any interview problem

Backtracking Method | Sum of Subset Problem | DAA | Lec-54 | Bhanu Priya
▶︎

Backtracking Method | Sum of Subset Problem | DAA | Lec-54 | Bhanu Priya

How to outsmart the Prisoner’s Dilemma - Lucas Husted
▶︎

How to outsmart the Prisoner’s Dilemma - Lucas Husted

Subset Sum Problem Dynamic Programming
▶︎

Subset Sum Problem Dynamic Programming

Lec-42 : 0/1 Knapsack using Branch and Bound with example
▶︎

Lec-42 : 0/1 Knapsack using Branch and Bound with example