{"request":{"endpoint":"https://exercism.org/api/v2/tracks/scala/exercises/palindrome-products/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"c330c750479049b7ae5452a7199d7492","snippet":"import PalindromeProducts._ import scala.util.Try case class PalindromeProducts(start: Int, end: Int) { val factoredPairs: Seq[(Int, Int)] = for { i <- start to end j <- i to end if isPalindrome(i * j) } yield(i, j) ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"exceptioned","published_at":"2019-03-05T19:11:03.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"Ronybony1990"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/Ronybony1990","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"631fba24e3694bb4babba9392d62dd35","snippet":"/** * Created by kevin on 13/04/15. */ // ***note that although this works, it's just a brute force solver // which makes it very slow (30+ seconds for the tests!) // limiting which multiplicands to use in genPs has cut the time to 20+ seconds // and then using a simple map cache in the companion object cut the test time to 10+ seconds. // then using vectors instead of lists and limiting factors to consider cuts the test time to 7+ seconds. // using sets and then just scanning for the min and max should be faster than using Vectors and Lists ","num_views":0,"num_stars":1,"num_comments":1,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":33,"iteration_status":"tests_failed","published_iteration_head_tests_status":"failed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"KoolerKing"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/KoolerKing","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"8c50a8102116401eae0063564c5f3c03","snippet":"import scala.annotation.tailrec import scala.util.Try case class PalindromeProducts(palindromes: Map[Int, Set[(Int, Int)]]) { def largest: Option[(Int, Set[(Int, Int)])] = { Try { palindromes.maxBy(_._1) }.toOption ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":33,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"jicahoo"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/jicahoo","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"28f0368b25ab42229ddcde05edfa38b9","snippet":"case class PalindromeProducts(a: Int, b: Int) { implicit val order = Ordering.by((x: (Int, Set[(Int, Int)])) => x._1) val map = ( for { i <- (a to b) j <- (i to b) c = i * j if isPalindrome(c) } yield c -> (i, j) ","num_views":0,"num_stars":0,"num_comments":1,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"tests_failed","published_iteration_head_tests_status":"errored","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"KimDaesap"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/KimDaesap","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"3173d5f0b3704723968a263f5150e806","snippet":"case class PalindromeProducts(f1: Int, f2: Int){ lazy val pals = (for { i <- f1 to f2 j <- f1 to f2 if (i*j).toString == (i*j).toString.reverse } yield i*j).distinct.sorted def factors(s: Int): Set[(Int,Int)] = (for (n <- f1 to f2 if s % n == 0 && s/n >= f1 && s/n <= f2) yield if (n < s/n) (n,s/n) else (s/n,n)).toSet ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":17,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"jaratma"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/jaratma","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"5b964851c9284903a17cd5701a3c528e","snippet":"object PalindromeProducts { type Product = Option[(Int, Set[(Int, Int)])] private def factors(n: Int, r: Range): Set[(Int, Int)] = (1 to math.sqrt(n.asInstanceOf[Double]).asInstanceOf[Int]) .map(f => (f, n / f)).filter{case (a, b) => a * b == n && r.contains(a) && r.contains(b)}.toSet private def firstInRange(ps: Range, fs: Range): Product = ps.find(n => n.toString == n.toString.reverse && factors(n, fs).exists(f => fs.contains(f._1) && fs.contains(f._2))) .map(p => (p, factors(p, fs))) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-05-24T19:59:21.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"tinnuir"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/tinnuir","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"f1550ae624a94482bd8aef9518a35d3c","snippet":"import scala.annotation.tailrec case class PalindromeProducts(start: Int, end: Int) { def smallest: Option[(Int, Set[(Int, Int)])] = getPalindromes .minByOption(_._1) def largest: Option[(Int, Set[(Int, Int)])] = getPalindromes .maxByOption(_._1) private def getPalindromes = (start to end).to(LazyList) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-04-14T15:34:23.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"olaforest"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/olaforest","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"8dbbb29d1863486691f296db8789621b","snippet":"import scala.annotation.tailrec case class PalindromeProducts(start: Int, end: Int) { private val mappedPalindromes = (for { x<- start to end y<- x to end if(x * y) == reverseNumber(x*y) } yield( (x,y))).map(a=>(a,a._1*a._2)).toMap ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-11-27T16:04:10.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"nickandh"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/nickandh","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"843d462c44f042ebb853052919425d0a","snippet":"case class PalindromeProducts(from: Int, to: Int) { private lazy val prods = (from to to).toStream .flatMap(i => (from to to).toStream.map((i, _))) .map { case (m1, m2) => (m1, m2, m1 * m2) } .filter { case (_, _, result) => result.toString.reverse.equals(result.toString) } .groupBy { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":19,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2020-01-24T14:11:38.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"oleg-zinovev"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/oleg-zinovev","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"a9b6c65a4bd6455287cba4521a80485a","snippet":"case class PalindromeProducts(a: Int, b: Int){ private val m = (for { x <- (a to b) y <- (x to b) if (isPalin(x*y))} yield (x*y, (x, y))).groupBy(_._1)map{case (k,v) => (k, v.map(_._2).toSet)} def smallest: Option[(Int, Set[(Int,Int)])] = if (m.size > 0) Some(m.minBy(_._1)) else None def largest: Option[(Int, Set[(Int,Int)])] = if (m.size > 0) Some(m.maxBy(_._1)) else None def isPalin(x: Int): Boolean = x == x.toString.reverse.toInt } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"exceptioned","published_at":"2019-10-27T21:47:16.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"hyh1618"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/hyh1618","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"62b18f393d234be5bd3c35c85b044993","snippet":"import scala.util.Try case class PalindromeProducts(start: Int, end: Int) { lazy val range = start to end lazy val pals = (for { r1 <- range r2 <- range r = r1 * r2 s = r.toString if s.equals(s.reverse) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2019-07-02T14:46:54.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"bigjackt"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/bigjackt","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"0270ed7ba4c9450b942a7dfcdc157c35","snippet":"import PalindromeProducts._ object PalindromeProducts { type Palindrome = (Int, Set[(Int, Int)]) type PalindromeMap = Map[Int, Set[(Int, Int)]] def isPalindrome(int: Int): Boolean = int.toString == int.toString.reverse ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":31,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2020-07-11T05:15:40.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"R4ncid"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/R4ncid","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"dc43008ddfd74da7bf3e19c4db6f65d2","snippet":"import scala.annotation.tailrec case class PalindromeProducts(min: Int, max: Int) { lazy val palindromeProducts = { for { x <- min to max y <- x to max if isPalindrome(x * y) } yield (x * y, (x, y)) }.groupMapReduce(_._1)(e => Set(e._2))(_ ++ _) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-12-27T19:32:01.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"eeng"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/eeng","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"7a94880c9101432485cb16c7fa0180e6","snippet":"case class PalindromeProducts(first: Int, last: Int) { import Math.sqrt var _small: (Int, Set[(Int, Int)]) = (0, Set((0, 0))) var _large: (Int, Set[(Int, Int)]) = (0, Set((0, 0))) _findSmallPalindrome _findLargePalindrome def smallest: Option[(Int, Set[(Int,Int)])] = if(last > first && _small._1 != 0) Some(_small) else None ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":58,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-10-12T20:34:53.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"bpiwo"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/bpiwo","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"ac18ea19d81f4d39a33903dbbe756881","snippet":"import scala.util.Try case class PalindromeProducts(start: Int, end: Int) { def smallest: Option[(Int, Set[(Int, Int)])] = Try { val head = findPalindromes.head (head._1, head._2.map(e => (e._2, e._3)).toSet) }.toOption def largest: Option[(Int, Set[(Int, Int)])] = Try { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"exceptioned","published_at":"2024-01-31T23:35:05.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"stevebosman"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/stevebosman","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"e7e6c12b9ee54565bad8b14e31883d9f","snippet":"case class PalindromeProducts(start: Int, end: Int) { private val palindromes = getAllPalindromes .groupBy(_._1) .map { case (k, v) => (k, v.map(toSortedSet).foldLeft(Set.empty[(Int, Int)])((acc, s) => acc ++ s)) } .toList .sortBy(_._1) val smallest: (Int, Set[(Int, Int)]) = palindromes.head ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"pvillega"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/pvillega","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"809cbfc5278d45b1a8ab26459928dbaf","snippet":"case class PalindromeProducts(start: Int, end: Int) { private val range = ((if (start < 1) 1 else start) to end) private def factors(n: Int): Set[(Int, Int)] = range.flatMap { divisor => val quotient = n / divisor if (n % divisor == 0 && range.contains(quotient)) Some(if (divisor < quotient) (divisor, quotient) else (quotient, divisor)) else None }.toSet ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"dadrox"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/dadrox","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"bf58570a1b3e4ee7af40c7ff91709c48","snippet":"case class PalindromeProducts(start: Int, end: Int) { private def isPalindrom(num: Int) = { val numInString = num.toString numInString == numInString.reverse } val (smallest, largest) = { val bag = for ( ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-10-27T12:42:10.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"stsolak"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/stsolak","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"7f732930281849618c9d0f791b739028","snippet":"case class PalindromeProducts(begin: Int, end: Int) { val palindromes = for { a <- begin to end b <- a to end if (isPalindrome(a*b)) } yield (a*b, a, b) def largest: (Int, Set[(Int,Int)]) = { val largestPalindrome: Int = palindromes.map(_._1).max ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"tests_failed","published_iteration_head_tests_status":"failed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"ahaljh"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/ahaljh","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"1771c7d767de4bb0a75b775818154136","snippet":"import java.lang.Math._ case class PalindromeProducts(start: Int, end: Int) { private val palSet = palindromes(products(start, end)).sorted def smallest: Option[(Int, Set[(Int,Int)])] = { val palSet = palindromes(products(start, end)).sorted palSet match { case x if x.isEmpty => None case _ => Option(palSet.head, factors(palSet.head)) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":36,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2019-05-13T08:29:49.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"bgarfin"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/bgarfin","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"733143afbb3c431cbb0fe8544798ef40","snippet":"case class PalindromeProducts (min: Int, max: Int) { import scala.util.Try private def isPalindrome (n: Int): Boolean = n == n.toString.reverse.toInt private def factorPairs (n: Int): Seq[(Int, Int)] = for { x <- min.max(1) to ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-07-11T15:53:56.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"heptalophos"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/heptalophos","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"907b0326f1ee469f8c52583bf1ab93a6","snippet":"import java.lang.Math.{min, max} case class PalindromeProducts(start: Int, end: Int) { def smallest: Option[(Int, Set[(Int, Int)])] = palindromeNums().reduceOption( _ min _).map(n => (n, factors(n))) def largest: Option[(Int, Set[(Int, Int)])] = palindromeNums().reduceOption( _ max _).map(n => (n, factors(n))) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-02-15T16:06:59.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"atisvagyok"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/atisvagyok","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"6ce41fe528fe48b49dc3a7af0b4f80a2","snippet":"import scala.util.Try final case class PalindromeProducts(a: Int, b: Int) { val factoredPairs: Seq[(Int, Int)] = for { i <- a to b j <- i to b if isPalindrome(i * j) } yield (i, j) val factoredProductPairs: Map[Int, Set[(Int, Int)]] = factoredPairs.toSet.groupBy { case (x, y) => x * y } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-02-04T12:10:16.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"cinnes"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/cinnes","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}},{"uuid":"ffcbaafa8f8f45d797efce2690f11a29","snippet":"case class PalindromeProducts(from:Int, to:Int){ def smallest:Option[(Int,Set[(Int,Int)])]={ find(_.min) } def largest:Option[(Int,Set[(Int,Int)])]={ find(_.max) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":32,"iteration_status":"tests_failed","published_iteration_head_tests_status":"failed","published_at":"2020-02-11T22:10:14.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"mendellev"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/solutions/mendellev","private_iterations_url":"https://exercism.org/el/tracks/scala/exercises/palindrome-products/iterations"}}],"meta":{"current_page":1,"total_count":73,"total_pages":4,"unscoped_total":73}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders