longest common prefix

Author: sachuverma

Striver Sheet/Day-15/Longest Common Prefix.cpp

@@ -0,0 +1,45 @@
+/*
+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 lower-case English letters.
+*/
+
+class Solution
+{
+public:
+  string longestCommonPrefix(vector<string> &strs)
+  {
+    string ans;
+    int minLen = INT_MAX;
+    for (auto &i : strs)
+      minLen = min(minLen, (int)i.size());
+    for (int i = 0; i < minLen; ++i)
+    {
+      int ch = strs[0][i];
+      for (int j = 1; j < strs.size(); ++j)
+      {
+        if (strs[j][i] != ch)
+          return ans;
+      }
+      ans += ch;
+    }
+    return ans;
+  }
+};

Striver Sheet/README.md

@@ -138,7 +138,7 @@
 - [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) - [Cpp Soultion](./Day-15/Integer%20to%20Roman.cpp)
 - [Implement strStr](https://leetcode.com/problems/implement-strstr/) - [Cpp Soultion](./Day-15/Implement%20strStr.cpp)
 - [String to Integer](https://leetcode.com/problems/string-to-integer-atoi/) - [Cpp Soultion](./Day-15/String%20to%20Integer.cpp)
-- []() - [Cpp Soultion](./Day-15/.cpp)
+- [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) - [Cpp Soultion](./Day-15/Longest%20Common%20Prefix.cpp)
 - []() - [Cpp Soultion](./Day-15/.cpp)
 
 ###