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

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

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

42,641 questions

55,376 answers

573 users

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

1 Answer

0 votes
import scala.util.matching.Regex

object LongestCommonPrefix {

  def longestCommonPrefix(input: String): String =
    if input == null || input.trim.isEmpty then
      ""
    else
      val words = input
        .toLowerCase
        .split("\\W+")
        .filter(_.nonEmpty)

      if words.isEmpty then
        ""
      else
        var prefix = words.head

        for word <- words do
          while !word.startsWith(prefix) do
            prefix = prefix.dropRight(1)

        prefix    


  def main(args: Array[String]): Unit = {
    val s1 = "The lowly inhabitants of the lowland were surprised to see the lower branches."
    println(s"LCP: '${longestCommonPrefix(s1)}'")

    val s2 = "unclear, uncertain, unexpected"
    println(s"LCP: '${longestCommonPrefix(s2)}'")
  }
}




/*
run:

LCP: ''
LCP: 'un'

*/

 



answered Mar 12 by avibootz

Related questions

...