Knapsack Problem on Algorithm Solutionshttps://algorithm.liangqin.ren/tags/knapsack-problem/Recent content in Knapsack Problem on Algorithm SolutionsHugo -- gohugo.ioThu, 03 Sep 2026 17:18:53 -0500416. Partition Equal Subset Sumhttps://algorithm.liangqin.ren/leetcode/416/Thu, 03 Sep 2026 17:18:53 -0500https://algorithm.liangqin.ren/leetcode/416/1. Description Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false otherwise. 2. Example Example 1 Input: nums = [1,5,11,5] Output: true Explanation: The array can be partitioned as [1, 5, 5] and [11]. Example 2 Input: nums = [1,2,3,5] Output: false Explanation: The array cannot be partitioned into equal sum subsets.