add: test

Author: ongch

LeetcodeProblemsTests/Algorithms/Longest_Common_Prefix_Test.js

@@ -0,0 +1,11 @@
+
+const assert = require('assert');
+const longestCommonPrefix = require('../../LeetcodeProblems/Algorithms/Longest_Common_Prefix').longestCommonPrefix;
+
+function test() {
+  assert.equal(longestCommonPrefix(["flower","flow","flight"]), "fl");
+  assert.equal(longestCommonPrefix(["dog","racecar","car"]), "");
+  assert.equal(longestCommonPrefix([]), "");
+}
+
+module.exports.test = test;

README.md

@@ -76,7 +76,7 @@ To run a specific problem in your console run  `node <problem_file_path>` (e.g.
 | [Binary Gap ](/LeetcodeProblems/Algorithms/Binary_Gap.js)                                                       | Easy   | https://leetcode.com/problems/binary-gap/ |
 | [Binary Gap ](/LeetcodeProblems/Algorithms/Binary_Gap.js)                                                       | Easy   | https://leetcode.com/problems/binary-gap/ |
 | [Majority Element](/LeetcodeProblems/Algorithms/Majority_Element.js)                                            | Easy   | https://leetcode.com/problems/majority-element/ |
-| [Longest Common Prefix](/LeetcodeProblems/Algorithms/Longest_Common_Prefix.js)                                            | Easy   | https://leetcode.com/problems/longest-common-prefix/ |
+| [Longest Common Prefix](/LeetcodeProblems/Algorithms/Longest_Common_Prefix.js)                                  | Easy   | https://leetcode.com/problems/longest-common-prefix/ |
 | [Tic Tac Toe ](/LeetcodeProblems/Algorithms/Tic_Tac_Toe.js)                                                     |        | |
 | [Permutations With Duplicates ](/LeetcodeProblems/Algorithms/Permutations_With_Duplicates.js)                   |        | |
 | [Deletion Distance](/LeetcodeProblems/Algorithms/Deletion_Distance.js)                                          |        | |