diff --git a/algorithms/arrays/0014-longest-common-prefix/README.md b/algorithms/arrays/0014-longest-common-prefix/README.md
new file mode 100644
index 0000000..cdd2476
--- /dev/null
+++ b/algorithms/arrays/0014-longest-common-prefix/README.md
@@ -0,0 +1,29 @@
+# 0014 - Longest Common Prefix
+
+## Problem
+
+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 if it is non-empty.