Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Semrush - keyword research tool

Create your online store today with Shopify

Turn ChatGPT, Claude, Gemini, And CoPilot Into Your Personal Assistant, Business Coach, Content Creator, And More

AFFILIATE MARKETING Your all-in-one performance engine Manage affiliates, creators, and customer referrals in one unified platform—turning every partnership into measurable growth

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Disclosure: My content contains affiliate links.

43,693 questions

57,001 answers

573 users

How to find the longest common prefix of all the words in a string with Swift

1 Answer

0 votes
import Foundation

func longestCommonPrefix(_ input: String) -> String {
    let trimmed = input.trimmingCharacters(in: .whitespacesAndNewlines)
    if trimmed.isEmpty { return "" }

    // Split by non‑word characters (similar to Java's split("\\W+"))
    let words = trimmed
        .lowercased()
        .components(separatedBy: CharacterSet.alphanumerics.inverted)
        .filter { !$0.isEmpty }

    guard let first = words.first else { return "" }

    var prefix = first

    for word in words {
        while !word.hasPrefix(prefix) {
            prefix.removeLast()
            if prefix.isEmpty { return "" }
        }
    }

    return prefix
}

let s1 = "The lowly inhabitants of the lowland were surprised to see the lower branches."
print("LCP: '\(longestCommonPrefix(s1))'")

let s2 = "unclear, uncertain, unexpected"
print("LCP: '\(longestCommonPrefix(s2))'")



/*
run:

LCP: ''
LCP: 'un'

*/

 



answered Mar 12 by avibootz

Related questions

...