solves ongest common prefix

Author: anishLearnsToCode

README.md

@@ -6,8 +6,8 @@
 | 1 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/TwoSum.java) | 
 | 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/ReverseInteger.java) |
 | 9 | [PalindromeNumber](https://leetcode.com/problems/palindrome-number/) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/PalindromeNumber.java) |
-| 2 | [Roman To Integer](https://leetcode.com/problems/roman-to-integer/) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/RomanToInteger.java) |
-| 2 | []() | Easy | |
+| 13 | [Roman To Integer](https://leetcode.com/problems/roman-to-integer/) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/RomanToInteger.java) |
+| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | |
 | 2 | []() | Easy | |
 | 2 | []() | Easy | |
 | 2 | []() | Easy | |

src/LongestCommonPrefix.java

@@ -0,0 +1,28 @@
+// https://leetcode.com/problems/longest-common-prefix/
+
+public class LongestCommonPrefix {
+    public static void main(String[] args) {
+
+    }
+
+    public String longestCommonPrefix(String[] array) {
+        if (array.length == 0) {
+            return "";
+        }
+
+        String result = array[0];
+        for (int index = 1 ; index < array.length ; index++) {
+            result = longestCommonPrefix(result, array[index]);
+        }
+        return result;
+    }
+
+    private String longestCommonPrefix(String first, String second) {
+        for (int index = 0 ; index < first.length() && index < second.length() ; index++) {
+            if (first.charAt(index) != second.charAt(index)) {
+                return first.substring(0, index);
+            }
+        }
+        return first.length() < second.length() ? first : second;
+    }
+}