New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Title: 划分为k个相等的子集(Partition to K Equal Sum Subsets) #268

Open

github-actions bot opened this issue Aug 25, 2024 · 0 comments

Labels

github-actions bot commented Aug 25, 2024

Difficulty: Medium
Tags: 位运算(Bit Manipulation)、记忆化搜索(Memoization)、数组(Array)、动态规划(Dynamic Programming)、回溯(Backtracking)、状态压缩(Bitmask)
Link: https://leetcode.com/problems/partition-to-k-equal-sum-subsets
LinkCN: https://leetcode.cn/problems/partition-to-k-equal-sum-subsets

github-actions bot added the leetcode label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment