# Longest Common Prefix Program Solution

We at gradjobopenings.com provide free job alerts of freshers job drives. In this website we list on campus job openings for freshers and off campus job openings for freshers and also work from home job openings. This is the best website to apply for off campus drive in India. Visit our website for government job alerts and private job alerts. We also list free interview notes and study materials, one of the best interview study website.comfortable to face the interviews:

Problem Statement

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.
• Time: O(|strs[0]|.|strs|)
• Space: O(|strs[0]|)

### Longest Common Prefix Program Solution In C++

``````class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if (strs.empty())
return "";

for (int i = 0; i < strs[0].length(); ++i)
for (int j = 1; j < strs.size(); ++j)
if (i == strs[j].length() || strs[j][i] != strs[0][i])
return strs[0].substr(0, i);

return strs[0];
}
};
``````

### Longest Common Prefix Program Solution In JAVA

``````class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs.length == 0)
return "";

for (int i = 0; i < strs[0].length(); ++i)
for (int j = 1; j < strs.length; ++j)
if (i == strs[j].length() || strs[j].charAt(i) != strs[0].charAt(i))
return strs[0].substring(0, i);

return strs[0];
}
}
``````

### Longest Common Prefix Program Solution In PYTHON

``````class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
if not strs:
return ''

for i in range(len(strs[0])):
for j in range(1, len(strs)):
if i == len(strs[j]) or strs[j][i] != strs[0][i]:
return strs[0][:i]

return strs[0]
``````
error: Content is protected !!