diff --git a/Medium/287. Find Duplicate Number/New Approach/Solution.java b/Medium/287. Find Duplicate Number/New Approach/Solution.java
new file mode 100644
index 0000000..33d01d8
--- /dev/null
+++ b/Medium/287. Find Duplicate Number/New Approach/Solution.java	
@@ -0,0 +1,13 @@
+import java.util.Arrays;
+public 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;
+    }
+    
+}
diff --git a/Medium/287. Find Duplicate Number/New Approach/sol.md b/Medium/287. Find Duplicate Number/New Approach/sol.md
new file mode 100644
index 0000000..a1ec791
--- /dev/null
+++ b/Medium/287. Find Duplicate Number/New Approach/sol.md	
@@ -0,0 +1,13 @@
+### Simplest and Easiest approach to solve
+
+1. Sort the input array `nums` in ascending order.
+   
+2. Initialize a loop from `i` = 1 to `n` (inclusive), where `n` is the length of the sorted `nums` array.
+
+3. Within the loop:
+
+   a. Check if `nums[i]` is equal to `nums[i-1]`.
+   
+   b. If the condition is true, return `nums[i]` as it is the duplicate element.
+      
+4. If no duplicate is found after the loop completes, return -1 to indicate that there are no duplicates in the array.