Time: 6 ms (98.26%) | Memory: 55.3 MB (73.25%) - LeetSync

Author: sayandip20

131-palindrome-partitioning/palindrome-partitioning.java

@@ -0,0 +1,28 @@
+class Solution {
+    public List<List<String>> partition(String s) {
+        List<List<String>> res = new ArrayList<>();
+        List<String> path = new ArrayList<>();
+        func(0,s,path,res);
+        return res;
+    }
+    void func(int index, String s, List<String> path, List<List<String>> res){
+        if(index==s.length()){
+            res.add(new ArrayList<>(path));
+            return;
+        }
+        for(int i=index;i<s.length();++i){
+            if(isPalindrome(s,index,i)){
+                path.add(s.substring(index,i+1));
+                func(i+1,s,path,res);
+                path.remove(path.size()-1);
+            }
+        }
+    }
+    boolean isPalindrome(String s,int start,int end){
+        while(start<=end){
+            if(s.charAt(start++)!=s.charAt(end--))
+                return false;
+        }
+        return true;
+    }
+}