Merge pull request neetcode-gh#89 from KHemanthRaju/main

neetcode-gh · web-flow · commit 8fc0f4a90b4d · 2022-04-07T20:24:34.000-07:00
Added 131. Palindrome Partitioning Java Solution
diff --git a/java/131-Palindrome-Partitioning.java b/java/131-Palindrome-Partitioning.java
@@ -0,0 +1,26 @@
+public class Solution {
+    public List<List<String>> partition(String s) {
+        List<List<String>> res = new ArrayList<List<String>>();
+        if (s.equals("")) {
+            res.add(new ArrayList<String>());
+            return res;
+        }
+        for (int i = 0; i < s.length(); i++) {
+            if (isPalindrome(s, i + 1)) {
+                for (List<String> list : partition(s.substring(i+1))) {
+                    list.add(0, s.substring(0, i + 1));
+                    res.add(list);
+                }
+            }
+        }
+        return res;
+    }
+    
+    public boolean isPalindrome(String s, int n) {
+        for (int i = 0; i < n / 2; i++) {
+            if (s.charAt(i) != s.charAt(n - i - 1))
+                return false;
+        }
+        return true;
+    }
+}
diff --git a/java/287-Find-the-Duplicate-Number.java b/java/287-Find-the-Duplicate-Number.java
@@ -0,0 +1,11 @@
+class Solution {
+    public int findDuplicate(int[] nums) {
+        Arrays.sort(nums);
+        for(int i=1;i<nums.length;i++){
+            if(nums[i] == nums[i-1]){
+                return nums[i];
+            }
+        }
+        return -1;
+    }
+}
