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.
881 B
881 B
TODO 0131. Palindrome Partitioning medium
Given a string s, partition s such that every substring of the partition is a palindrome. Return /all possible palindrome partitioning of /~s~.
Example 1:
Input: s = "aab"
Output: [["a","a","b"],["aa","b"]]Example 2:
Input: s = "a"
Output: [["a"]]Constraints:
1 <= s.length <= 16scontains only lowercase English letters.
TODO Approach
Write your approach here.
TODO Python
class Solution:
def partition(self, s: str) -> List[List[str]]:TODO C++
class Solution {
public:
vector<vector<string>> partition(string s) {
}
};