Longest Common Substring

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

Code

Algorithms

longest = ''
(0...a.length).each do |i|
  (i+1..a.length).each do |j|
    current = a[i...j]
    longest = current if b.include?(current) && current.length > longest.length
  end
end
return longest

Parameters

a(string)

First string

b(string)

Second string

Server

More Ruby 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.