Merge pull request neetcode-gh#2030 from saip7795/sp/palindrome-partitioning

Create : 0131-Palindrome-Partitioning.rb

Author: saip7795

ruby/0131-palindrome-partitioning.rb

@@ -0,0 +1,33 @@
+def partition(s)
+    @result = []
+    @part = []
+    @s = s
+
+    def dfs(i)
+        if i >= @s.length
+            @result.append(@part.dup())
+            return
+        end
+        (i..@s.length-1).each do |j|
+            if is_palindrome(@s,i,j)
+                @part.append(@s[i..j])
+                dfs(j+1)
+                @part.pop()
+            end
+        end
+    end
+
+    dfs(0)
+
+    return @result
+end
+
+
+def is_palindrome(s,i,j)
+    while i<j
+        return false if s[i] != s[j]
+        i +=1
+        j -=1
+    end
+    return true
+end