From af7318e1f34affbae02c24cca869065914339955 Mon Sep 17 00:00:00 2001
From: Koneti Hemanth Raju <rajuhemanth456@gmail.com>
Date: Tue, 5 Apr 2022 00:32:23 +0530
Subject: [PATCH 1/4] Added Binary Search Java solution

---
 java/704. Binary Search.java | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 java/704. Binary Search.java

diff --git a/java/704. Binary Search.java b/java/704. Binary Search.java
new file mode 100644
index 000000000..ca1227c31
--- /dev/null
+++ b/java/704. Binary Search.java	
@@ -0,0 +1,21 @@
+class Solution {
+    public int search(int[] nums, int target) {
+        int n = nums.length;
+        int low = 0,high = n-1;
+        while(low<=high){
+            int mid = (low+high)/2;
+            if(nums[mid] == target){
+                return mid;
+            }
+            
+            else if(nums[mid]<target){
+                low = mid+1;
+            }
+            
+            else{
+                high = mid - 1;
+            }
+        }
+        return -1;
+    }
+}
\ No newline at end of file

From 22d88a27a8821f0cdae91c93006d1791f5940fe2 Mon Sep 17 00:00:00 2001
From: Koneti Hemanth Raju <rajuhemanth456@gmail.com>
Date: Thu, 7 Apr 2022 17:31:53 +0530
Subject: [PATCH 2/4] Added Palindrome Partitioning Java Solution

---
 java/131-Palindrome-Partitioning.java | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 java/131-Palindrome-Partitioning.java

diff --git a/java/131-Palindrome-Partitioning.java b/java/131-Palindrome-Partitioning.java
new file mode 100644
index 000000000..d4c13c802
--- /dev/null
+++ 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;
+    }
+}
\ No newline at end of file

From 9b8c595501ab5b142aad0a88bba9452cc152f829 Mon Sep 17 00:00:00 2001
From: Koneti Hemanth Raju <49878564+KHemanthRaju@users.noreply.github.com>
Date: Thu, 7 Apr 2022 17:36:54 +0530
Subject: [PATCH 3/4] Delete Binary search file

---
 java/704. Binary Search.java | 21 ---------------------
 1 file changed, 21 deletions(-)
 delete mode 100644 java/704. Binary Search.java

diff --git a/java/704. Binary Search.java b/java/704. Binary Search.java
deleted file mode 100644
index ca1227c31..000000000
--- a/java/704. Binary Search.java	
+++ /dev/null
@@ -1,21 +0,0 @@
-class Solution {
-    public int search(int[] nums, int target) {
-        int n = nums.length;
-        int low = 0,high = n-1;
-        while(low<=high){
-            int mid = (low+high)/2;
-            if(nums[mid] == target){
-                return mid;
-            }
-            
-            else if(nums[mid]<target){
-                low = mid+1;
-            }
-            
-            else{
-                high = mid - 1;
-            }
-        }
-        return -1;
-    }
-}
\ No newline at end of file

From 8dde74f685c559f7d6539bb746a693b8d5feac39 Mon Sep 17 00:00:00 2001
From: Koneti Hemanth Raju <rajuhemanth456@gmail.com>
Date: Thu, 7 Apr 2022 17:43:18 +0530
Subject: [PATCH 4/4] Added Find the duplicate number java Solution

---
 java/287-Find-the-Duplicate-Number.java | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 java/287-Find-the-Duplicate-Number.java

diff --git a/java/287-Find-the-Duplicate-Number.java b/java/287-Find-the-Duplicate-Number.java
new file mode 100644
index 000000000..e086a1c12
--- /dev/null
+++ 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;
+    }
+}
\ No newline at end of file