We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent fe2a804 commit 3c1b061Copy full SHA for 3c1b061
src/main/java/com/fishercoder/solutions/_14.java
@@ -1,25 +1,5 @@
1
package com.fishercoder.solutions;
2
3
-/**
4
- * 14. Longest Common Prefix
5
- *
6
- * Write a function to find the longest common prefix string amongst an array of strings.
7
8
- * If there is no common prefix, return an empty string "".
9
10
- * Example 1:
11
- * Input: ["flower","flow","flight"]
12
- * Output: "fl"
13
14
- * Example 2:
15
- * Input: ["dog","racecar","car"]
16
- * Output: ""
17
- * Explanation: There is no common prefix among the input strings.
18
19
- * Note:
20
- * All given inputs are in lowercase letters a-z.
21
- */
22
-
23
public class _14 {
24
25
public static class Solution1 {
0 commit comments