pg

bool (string s){
      int len = s.length();
      for(int i = 0; i < len/2; i++){
          if(s[i] != s[len-i-1])
              return false;
      }
      return true;
  }
  void help(string s, vector<string>& cur, set<vector<string>>& res){
      if(s == ""){
          res.insert(cur);
          return;
      }
      for(int i = 1; i <= s.length(); i++){
          string temp = s.substr(0,i);
          if(isPalindrome(temp)){
              cur.push_back(temp);
              help(s.substr(i, s.length()-i), cur, res);
              cur.erase(cur.end());
          }      
      }
  }

  vector<vector<string>> partition(string s) {
      set<vector<string>> resset;
      vector<string> cur;
      help(s, cur, resset);
      vector<vector<string>> res(resset.begin(), resset.end());
      return res;
}