Longest Common Substring

Find the longest contiguous substring that appears in both strings using an iterative approach.

Code

Algorithms

longest = ''
for i in range(len(a)):
    for j in range(i + 1, len(a) + 1):
        current = a[i:j]
        if current in b and len(current) > len(longest):
            longest = current
return longest

Parameters

a(string)

First string

b(string)

Second string

Server

More Python Snippets

Capitalize First Letter

Capitalize the first letter of a string while keeping the rest unchanged.

Center String

Center a string within a given width by padding with spaces.

Check if Palindrome

Check if a string is a palindrome by comparing characters from both ends.

Compare Strings (Case Insensitive)

Compare two strings ignoring case differences.

Convert to camelCase

Convert a string to camelCase format with lowercase first letter.

Convert to kebab-case

Convert a string to kebab-case.