DEV Community

Takahiro Kudo
Takahiro Kudo

Posted on

4 2

LeetCode "Longest Common Prefix"

Oh😮 I didn't know that question number is not fixed😧

Longest Common Prefix

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        if len(strs) == 0:
            return ''

        # check what is needed length
        min_len = len(strs[0])
        other_strs = strs[1:]
        for s in other_strs:
            len_s = len(s)
            if min_len > len_s:
                min_len = len_s

        # check prefix
        c = ''
        prefix = ''
        for i in range(min_len):
            c = strs[0][i]
            for s in other_strs:
                if c != s[i]:
                    c = ''

            # not longer a prefix
            if not c:
                break

            prefix += c

        return prefix
Enter fullscreen mode Exit fullscreen mode

Image of Datadog

Create and maintain end-to-end frontend tests

Learn best practices on creating frontend tests, testing on-premise apps, integrating tests into your CI/CD pipeline, and using Datadog’s testing tunnel.

Download The Guide

Top comments (0)

Heroku

This site is built on Heroku

Join the ranks of developers at Salesforce, Airbase, DEV, and more who deploy their mission critical applications on Heroku. Sign up today and launch your first app!

Get Started

👋 Kindness is contagious

Please leave a ❤️ or a friendly comment on this post if you found it helpful!

Okay