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 substring without repeating characters in Kotlin

1 Answer

0 votes
fun longestSubstring(s: String): String {
    var start = 0
    var maxLength = 0
    var longestSubstr = ""
    val charIndexMap = mutableMapOf<Char, Int>()

    for ((end, char) in s.withIndex()) {
        // If the character is already in the map and within the current window
        if (charIndexMap.containsKey(char) && charIndexMap[char]!! >= start) {
            start = charIndexMap[char]!! + 1 // Move the start pointer to avoid duplicates
        }

        // Update the character's latest index
        charIndexMap[char] = end

        // Check if the current substring is the longest
        val currentLength = end - start + 1
        if (currentLength > maxLength) {
            maxLength = currentLength
            longestSubstr = s.substring(start, end + 1)
        }
    }

    return longestSubstr
}

fun main() {
    // Test cases
    println(longestSubstring("abcabcbb")) // Output: "abc"
    println(longestSubstring("bbbbb"))    // Output: "b"
    println(longestSubstring("xwwwqfwwxqwyq")) // Output: "xqwy"
}

   
      
/*
run:
   
abc
b
xqwy
  
*/

 



answered Apr 7, 2025 by avibootz
...