leetcode 14 : eos or mismatch pattern : longest common prefix : c++ solution

LeetCode Problem 14: Longest Common Prefix . In this problem, you're given an array of strings, and you need to find the longest common prefix shared by all the strings in the array. A common prefix is a substring that appears at the beginning of all strings. The task is to return the longest such substring, or an empty string if no common prefix exists.

A simple approach is to compare characters of each string in the array one by one, stopping when a mismatch occurs. The time complexity is O(S), where S is the sum of all characters in the input strings.