diff --git a/MissingNumberInSortedArray.java b/MissingNumberInSortedArray.java
new file mode 100644
index 00000000..cecfae80
--- /dev/null
+++ b/MissingNumberInSortedArray.java
@@ -0,0 +1,17 @@
+
+class MissingNumberInSortedArray {
+    int missingNumber(int arr[]) {
+        // code here
+        int low = 0;
+        int high = arr.length-1;
+        while(low<=high){
+            int mid = (low+high)/2;
+            if(arr[mid]==mid+1){
+                low = mid+1;
+            }else{
+                high = mid-1;
+            }
+        }
+        return low+1;
+    }
+}
\ No newline at end of file
diff --git a/Problem1.java b/Problem1.java
deleted file mode 100644
index 8b137891..00000000
--- a/Problem1.java
+++ /dev/null
@@ -1 +0,0 @@
-
diff --git a/README.md b/README.md
index d3394c1a..64453848 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +1,6 @@
 # Competitive-Coding-1
 
 Please submit the interview problems posted in slack channel here. The problems and statements are intentionally not shown here so that students are not able to see them in advance 
+
+## Interview 1 problem
+https://www.geeksforgeeks.org/problems/missing-number-in-sorted-array-of-natural-numbers/1
\ No newline at end of file