Summary
Full Transcript
DP Playlist : https://youtube.com/playlist?list=PLauivoElc3gimdmLcIIpafEkzGs4tCQmi ALL CP/DSA RESOURCES : https://linktr.ee/iamluv FREE COMPETITIVE PROGRAMMING COURSE PLAYLIST : https://youtube.com/playlist?list=PLauivoElc3ggagradg8MfOZreCMmXMmJ- In this video I discuss the how to find if sum is a subset sum in a given array and also Leetcode Partition Equal Subset Problem using dynamic programming with proper explanation along with code. It is an example of 0-1 knapsack Practice Questions : https://www.interviewbit.com/problems/subset-sum-problem/# https://leetcode.com/problems/partition-equal-subset-sum/ https://atcoder.jp/contests/dp/tasks Timestamps: Explanation : (0:00) Code : (5:27) Be a part of our awesome Community. Join ○ Discord : https://discord.gg/GMH23tq7Y7 ○ Telegram : https://t.me/LuvIsMeYT ○ LinkTree : https://linktr.ee/iamluv You can follow me on below platforms for all the latest updates ○ Instagram : https://www.instagram.com/i._m_.luv/ ○ Twitter : https://twitter.com/Luvk1412 ○ Linkedin : https://www.linkedin.com/in/luvk1412/ Blog(Not frequently updated) ○ Blog : https://www.codewithluv.in Hashtags #subset #sum #dp #leetcode #tutorial
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
