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,704 questions

55,463 answers

573 users

How to check if every digit in a number appears only once in Kotlin

1 Answer

0 votes
// n % 10 extracts the last digit.
// 1 shl digit creates a bitmask for that digit.
// (mask and bit) checks whether the bit for this digit is already set.
// Mark the digit as seen: mask = mask or bit; This sets the bit for the current digit.

fun allDigitsUnique(n: Int): Boolean {
    var mask = 0
    var x = n

    while (x > 0) {
        val digit = x % 10
        val bit = 1 shl digit

        if ((mask and bit) != 0) return false // digit already seen
        mask = mask or bit

        x /= 10
    }

    return true
}

fun main() {
    var n = 123456
    println(if (allDigitsUnique(n)) "Unique" else "Not unique")

    n = 123452
    println(if (allDigitsUnique(n)) "Unique" else "Not unique")
}



/*
run:

Unique
Not unique

*/

 



answered Feb 27 by avibootz
...