Algorithm

The common prefix across all strings must exist between the smallest and largest string when sorted lexicographically.
Sorting the array helps bring these boundary strings to the extremes.
By comparing only the first and last strings, we can determine the full common prefix shared by the entire array.
Character-wise comparison from the beginning allows us to identify where the prefix stops.
The point at which the characters start differing marks the end of the shared prefix.
The portion before this mismatch is the longest common prefix among all strings.