Partition to K Equal Sum Subsets - LeetCode
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. Example 1: Example 2: Constraints: 1. Please don't post any solutions in this discussion. 2. The problem discussion is for asking questions about the problem or for sharing tips - anything except for solutions. 3. If you'd like to share your solution for feedback and ideas, please head to the solutions tab and post it there. Am I the only one who finds it hard. It is simple problem. Just try to draw recursion tree to understand the logic behind it. No Buddy.. I am with you. yes it is if you are trying with masking approach @dumbcoder03 gotta be kidding us man Why it is under DP i dont understand this Please anyone explain.It should be a backtracking problem Should be a HARD problem. This Should be Labeled Hard My 2017 solution, which beat 87% other solutions, got TLE today .. the problem evolved TLE hell hole This problem could not be solve