diff --git a/Submissions/DivyaChaurasiya/RemoveDuplicates/solution.java b/Submissions/DivyaChaurasiya/RemoveDuplicates/solution.java
new file mode 100644
index 0000000..aa668e7
--- /dev/null
+++ b/Submissions/DivyaChaurasiya/RemoveDuplicates/solution.java
@@ -0,0 +1,13 @@
+class Solution {
+    public int removeDuplicates(int[] nums) {
+        int i=0;
+        for(int j=1;j<nums.length;j++){
+            if(nums[i]!=nums[j]){
+                nums[i+1]=nums[j];
+                i++;
+            }
+        }  
+        return i+1;
+
+    }
+}
diff --git a/Submissions/DivyaChaurasiya/RemoveDuplicates/testcase.png b/Submissions/DivyaChaurasiya/RemoveDuplicates/testcase.png
new file mode 100644
index 0000000..ce08669
Binary files /dev/null and b/Submissions/DivyaChaurasiya/RemoveDuplicates/testcase.png differ
diff --git a/Submissions/DivyaChaurasiya/TwoSum/solution.java b/Submissions/DivyaChaurasiya/TwoSum/solution.java
new file mode 100644
index 0000000..2fa24ce
--- /dev/null
+++ b/Submissions/DivyaChaurasiya/TwoSum/solution.java
@@ -0,0 +1,15 @@
+class Solution {
+    public int[] twoSum(int[] nums, int target) 
+    {
+
+        int n=nums.length;
+        for(int i=0;i<n;i++){
+            for(int j=i+1;j<n;j++){
+                if(nums[i]+nums[j]==target){
+                    return new int[] {i,j};
+                }
+            }
+        }
+        return new int[] {};
+    }
+} 
diff --git a/Submissions/DivyaChaurasiya/TwoSum/testcase.png.png b/Submissions/DivyaChaurasiya/TwoSum/testcase.png.png
new file mode 100644
index 0000000..a24d2e6
Binary files /dev/null and b/Submissions/DivyaChaurasiya/TwoSum/testcase.png.png differ