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 string prefix in array of strings with Kotlin

1 Answer

0 votes
fun longestCommonPrefix(strs: Array<String>): String {
    if (strs.isEmpty()) return ""
    
    var prefix = strs[0]
    for (i in 1 until strs.size) {
        while (strs[i].indexOf(prefix) != 0) {
            prefix = prefix.substring(0, prefix.length - 1)
            if (prefix.isEmpty()) return ""
        }
    }
    
    return prefix
}

fun main() {
    val strings = arrayOf("cartography", "carburettor", "carbonating")
    
    println(longestCommonPrefix(strings))  
}

   
      
/*
run:

car
  
*/

 



answered Apr 25, 2025 by avibootz
...