Create Best Approach.cpp

Author: JawadSher

21 - Trie Data Structure Problems/03 - Longest Common Prefix/Best Approach.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    string longestCommonPrefix(vector<string>& strs) {
+        
+        string ans = "";
+        for(int i = 0; i < strs[0].length(); i++){
+            char ch = strs[0][i];
+
+            bool match = true;
+            for(int j = 1; j < strs.size(); j++){
+                if(strs[j].size() < i || ch != strs[j][i]){
+                    match = false;
+                    break;
+                }
+            }
+
+            if(match == false) break;
+            else ans.push_back(ch);
+        }
+
+        return ans;
+    }
+};