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

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

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

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,845 questions

51,766 answers

573 users

How to find the longest common string prefix in an array of strings with Scala

1 Answer

0 votes
import scala.util.Sorting

object FindTheLongestCommonStringPrefixInArrayOfStrings_Scala {
  def longestCommonPrefix(arr: Array[String]): String = {
    val size = arr.length

    if (size == 0) 
      return ""

    if (size == 1) 
      return arr(0)

    Sorting.quickSort(arr)

    val minLength = math.min(arr(0).length, arr(size - 1).length)

    var i = 0
    while (i < minLength && arr(0)(i) == arr(size - 1)(i)) 
      i += 1

    arr(0).substring(0, i)
  }

  def main(args: Array[String]): Unit = {
    val arr = Array("cartography", "carburetor", "carbonating", "cartoon")

    println(s"The longest common prefix: ${longestCommonPrefix(arr)}")
  }
}



/*
run:
    
The longest common prefix: car
    
*/

 



answered Aug 29, 2024 by avibootz
...