Added new solution

Author: PalmaAnd

Java/src/main/java/problems/leetcode/others/LongestCommonPrefix.java

@@ -0,0 +1,17 @@
+class Solution {
+    public String longestCommonPrefix(String[] strs) {
+        String prefix = "";
+        int length = strs[0].length();
+        for (int i = 1; i < strs.length; i++) {
+            length = Math.min(length, strs[i].length());
+        }
+        for (int j = 0; j < length; j++) {
+            char sol = strs[0].charAt(j);
+            for (int i = 1; i < strs.length; i++) {
+                if (sol != strs[i].charAt(j)) return prefix;
+            }
+            prefix += sol;
+        }
+        return prefix;
+    }
+}

README.md

@@ -40,6 +40,7 @@ Here is a list of the problems I've solved along with links to the corresponding
 | [Min Stack](https://leetcode.com/problems/min-stack/)                                                 | [Java](Java/src/main/java/problems/leetcode/stack/MinStack.java)                   |
 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)   | [Java](Java/src/main/java/problems/leetcode/stack/ReversePolish.java)              |
 | [3Sum](https://leetcode.com/problems/3sum/)                                                           | [Java](Java/src/main/java/problems/leetcode/two_pointers/ThreeSum.java)            |
+| [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)                          | [Java](Java/src/main/java/problems/leetcode/others/LongestCommonPrefix.java)       |
 
 ## Java Solutions