tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1023 B
1023 B
TODO 0416. Partition Equal Subset Sum medium
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/.
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.Constraints:
1 <= nums.length <= 2001 <= nums[i] <= 100
TODO Approach
Write your approach here.
TODO Python
class Solution:
def canPartition(self, nums: List[int]) -> bool:TODO C++
class Solution {
public:
bool canPartition(vector<int>& nums) {
}
};