304 North Cardinal St.
Dorchester Center, MA 02124

# Longest Common Prefix LeetCode Solution

## Problem – Longest Common Prefix

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.

### Longest Common Prefix LeetCode Solution in Python

`````` def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
if not strs:
return ""
shortest = min(strs,key=len)
for i, ch in enumerate(shortest):
for other in strs:
if other[i] != ch:
return shortest[:i]
return shortest
``````

### Longest Common Prefix LeetCode Solution in Java

``````public String longestCommonPrefix(String[] strs) {
if(strs == null || strs.length == 0)    return "";
String pre = strs;
int i = 1;
while(i < strs.length){
while(strs[i].indexOf(pre) != 0)
pre = pre.substring(0,pre.length()-1);
i++;
}
return pre;
}
``````

### Longest Common Prefix LeetCode Solution in C++

``````class Solution {
public:
string longestCommonPrefix(vector<string>& str) {
int n = str.size();
if(n==0) return "";

string ans  = "";
sort(begin(str), end(str));
string a = str;
string b = str[n-1];

for(int i=0; i<a.size(); i++){
if(a[i]==b[i]){
ans = ans + a[i];
}
else{
break;
}
}

return ans;

}
};
``````
##### Longest Common Prefix LeetCode Solution Review:

In our experience, we suggest you solve this Longest Common Prefix LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Longest Common Prefix LeetCode Solution

Find on LeetCode

##### Conclusion:

I hope this Longest Common Prefix LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions