131. Palindrome Partitioning(Leetcode Daily) || Recursion & Backtracking Explained || DSA || C++

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"]]

[PRASHANTKUMAR-wiil]

bhai samajh nhi aarha tha thanks samjh aagya 🙃