Скачать или смотреть Longest Common Prefix | Efficient O(n·m) Python Solution

"""
LeetCode 14: Longest Common Prefix
----------------------------------
Problem Description:
Given an array of strings, find the longest common prefix (LCP) among them.
If there is no common prefix, return an empty string "".

Example:
---------
Input: ["flower", "flow", "flight"]
Output: "fl"

Input: ["dog", "racecar", "car"]
Output: ""

Explanation:
------------
In the first example, "fl" is the longest common prefix shared by all strings.
In the second example, there is no common prefix, hence return an empty string.

Approach:
---------
1. Take the first string as the initial prefix.
2. Iterate through each string in the list.
3. Gradually shorten the prefix until the current string starts with it.
4. If the prefix becomes empty, return "" immediately.
5. Return the final prefix after all comparisons.

Complexity:
-----------
Time Complexity: O(n × m)
n = number of strings
m = length of the shortest string
Space Complexity: O(1)
Uses constant extra space.

This is a clean and efficient solution using the Horizontal Scanning method.
"""