Merge pull request #1 from Vidhi006/Vidhi006-patch-1

As part of Hacktoberfest 2025, this contribution promotes open-source collaboration and helps new contributors understand fundamental string algorithms in a clean, beginner-friendly way.

🖋️ Language Used

Python (or replace with Java / C++ / JavaScript as per your code)

🌟 Outcome

This contribution enhances algorithm repositories with a well-documented and efficient solution to the Longest Common Prefix problem — a great example for anyone learning data structures and algorithms.

Author: Vidhi006

longestCommonPrefix.java

@@ -0,0 +1,18 @@
+class Solution {
+    public String longestCommonPrefix(String[] strs) {
+        int n = strs.length;
+        if(n == 0) return "";
+        String prefix = strs[0];
+        for(int i=1; i<n; i++){
+            int j = 0;
+            while(j<prefix.length() && j<strs[i].length() && prefix.charAt(j) == strs[i].charAt(j)){
+                j++;
+            }
+            prefix = prefix.substring(0, j);
+            if(prefix.length() == 0){ 
+                return "";
+            }    
+        }
+        return prefix;
+    }
+}