diff --git a/Leetcode-Easy/1-TwoSum/TwoSum.java b/Leetcode-Easy/1-TwoSum/TwoSum.java
new file mode 100644
index 0000000..db3ad8e
--- /dev/null
+++ b/Leetcode-Easy/1-TwoSum/TwoSum.java
@@ -0,0 +1,15 @@
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        int[] array = new int[2];
+        for (int i=0; i<nums.length;i++ ){
+            for (int j=i+1;j <nums.length;j++){
+                if ((nums[i] + nums[j])==target){
+                   array[0]= i;
+                   array[1]= j;
+                   break;
+                }
+            }
+        }
+        return array;
+    }
+}