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

51,826 answers

573 users

How to generate all possible permutations of a string in Kotlin

1 Answer

0 votes
fun permutations(str: String): List<String> {
    if (str.isEmpty()) {
        return listOf("")
    }

    val result = mutableListOf<String>()
    
    for (i in str.indices) {
        val firstChar = str[i]
        val remainingChars = str.substring(0, i) + str.substring(i + 1)
        val subPermutations = permutations(remainingChars)

        for (subPermutation in subPermutations) {
            result.add(firstChar + subPermutation)
        }
    }
    
    return result
}

fun main() {
    val str = "abc"
    
    val allPermutations = permutations(str)
    
    allPermutations.forEach { println(it) }
}


 
/*
run:

abc
acb
bac
bca
cab
cba
 
*/

 



answered Jan 5, 2025 by avibootz
...