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 length of the longest consecutive zeroes in the binary representation of a number in Kotlin

1 Answer

0 votes
fun longestConsecutiveZeroes(n: Int): Int {
    // Function to find the longest sequence of consecutive zeroes in binary representation
    var maxCount = 0
    var currentCount = 0
    var num = n

    while (num > 0) {
        if ((num and 1) == 0) { // Check if the least significant bit is 0
            currentCount++
            maxCount = maxOf(maxCount, currentCount) // Update maxCount
        } else {
            currentCount = 0 // Reset count when a 1 is encountered
        }

        num = num shr 1 // Right shift the number
    }

    return maxCount
}

fun main() {
    val num = 11298 // Binary: 0010110000100010
    
    println("Longest consecutive zeroes: ${longestConsecutiveZeroes(num)}")
}



/*
run:

Longest consecutive zeroes: 4

*/

 



answered Sep 15, 2025 by avibootz
...