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

51,912 answers

573 users

How to recursively check if a number is palindrome in Scala

1 Answer

0 votes
object Check_If_Number_Is_Palindrome_Recursively_Scala {

  def recursivelyCheckPalindrome(n: Int, original: Int): Boolean = {
    if (n == 0) {
      original == original.abs.toString.reverse.toInt
    } else {
      
      recursivelyCheckPalindrome(n / 10, original)
    }
  }

  def main(args: Array[String]): Unit = {
    val n = 12321

    if (recursivelyCheckPalindrome(n, n)) {
      println("Palindrome")
    } else {
      println("NOT Palindrome")
    }
  }
}


   
/*
run:
   
Palindrome
   
*/

 



answered Oct 17, 2024 by avibootz
...