https://algorithm.liangqin.ren/tags/bitmask/Recent content in Bitmask on Algorithm SolutionsHugo -- gohugo.ioMon, 31 Aug 2026 13:07:04 -0500https://algorithm.liangqin.ren/leetcode/698/Mon, 31 Aug 2026 13:07:04 -0500https://algorithm.liangqin.ren/leetcode/698/1. Description Given an integer array nums and an integer k, return true if it is possible to divide this array into k non-empty subsets whose sums are all equal. 2. Example Example 1 Input: nums = [4,3,2,3,5,2,1], k = 4 Output: true Explanation: It is possible to divide it into 4 subsets (5), (1, 4), (2,3), (2,3) with equal sums. Example 2 Input: nums = [1,2,3,4], k = 3