Data Structures & Algorithms Minimum sum partition | Solved using Tabulation in Python4 Mins Read Given an array arr[] containing non-negative integers, the task is to divide it into two sets set1 and set2 such that the absolute difference between their sums is…
Data Structures & Algorithms Partition Equal Subset Sum | Leetcode 4163 Mins Read This problem is a direct extension of the Subset Sum Problem: instead of checking if any subset sums to a given…
Data Structures & Algorithms Subset Sum Problem | Solved using Dynamic Programming6 Mins Read Given an array of positive integers arr[] and a value sum, determine if there is a subset of arr[] with sum equal to given sum. Here’s…
