diff --git a/Java/Suvam Pattanaik/README.md b/Java/Suvam Pattanaik/README.md
new file mode 100644
index 0000000..56eb9ec
--- /dev/null
+++ b/Java/Suvam Pattanaik/README.md	
@@ -0,0 +1,26 @@
+## QUESTION LINK: https://leetcode.com/problems/longest-common-prefix/
+
+## DESCRIPTION:
+Write a function to find the longest common prefix string amongst an array of strings.
+
+If there is no common prefix, return an empty string "".
+
+ 
+
+# Example 1:
+
+Input: strs = ["flower","flow","flight"]
+Output: "fl"
+
+# Example 2:
+
+Input: strs = ["dog","racecar","car"]
+Output: ""
+Explanation: There is no common prefix among the input strings.
+ 
+
+## Constraints:
+
+1 <= strs.length <= 200
+0 <= strs[i].length <= 200
+strs[i] consists of only lowercase English letters.
diff --git a/Java/Suvam Pattanaik/longest_common_prefix.java b/Java/Suvam Pattanaik/longest_common_prefix.java
new file mode 100644
index 0000000..0266d7b
--- /dev/null
+++ b/Java/Suvam Pattanaik/longest_common_prefix.java	
@@ -0,0 +1,30 @@
+QUESTION: https://leetcode.com/problems/longest-common-prefix/
+Constraints:
+
+1 <= strs.length <= 200
+0 <= strs[i].length <= 200
+strs[i] consists of only lowercase English letters.
+
+
+
+  
+  
+CODE:
+class Solution {
+    public String longestCommonPrefix(String[] strs) {
+        if(strs.length==0)
+            return "";
+        String prefix = strs[0];
+        for(int i=0;i<strs.length;i++){
+            while(strs[i].indexOf(prefix)!=0){
+                prefix = prefix.substring(0,prefix.length()-1);
+                if(prefix.isEmpty()){
+                    return "";
+                    
+                }
+            }
+        }
+        return prefix;
+        
+    }
+}