{"request":{"endpoint":"https://exercism.org/api/v2/tracks/scala/exercises/collatz-conjecture/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"d6636d13cfa5469591283071bcde9015","snippet":"object CollatzConjecture { def steps(initial: Int, count: Int = 0): Option[Int] = initial match { case x if x < 1 => None case x if x == 1 => Some(count) case x if x % 2 == 0 => steps(x >> 1, count + 1) case x => steps((3 * x) + 1, count + 1) } }","num_views":0,"num_stars":17,"num_comments":3,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":8,"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":"DCameronMauch"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/DCameronMauch","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"a195228223c04311a1c5a96d57b2a1ee","snippet":"object CollatzConjecture { def steps(n: Int, step: Int = 0): Option[Int] = { n match { case n if n < 1 => None case 1 => Some(step) case even if n % 2 == 0 => steps(even / 2, step + 1) case odd => steps(odd * 3 + 1, step + 1) } } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":10,"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":"ChrisWilding"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/ChrisWilding","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"9cf3a4a01ce6481ea6f7d22b840a0496","snippet":"object CollatzConjecture { def steps(number: Int): Option[Int] = stepsHelper(0, number) private def stepsHelper(count: Int, current: Int): Option[Int] = { current match { case 1 => Some(count) case x if x <= 0 => None case x if x % 2 == 0 => stepsHelper(count + 1, x / 2) case x => stepsHelper(count + 1, x * 3 + 1) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-10-13T06:06:05.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"ErikSchierboom"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"1217daefd63a43aabdd427431bbeb37d","snippet":"import scala.annotation.tailrec object CollatzConjecture { @tailrec def steps(num: Int, acc: Int = 0): Option[Int] = num match { case 1 => Some(acc) case a if a <= 0 => None case b => if(b % 2 == 0) steps(b / 2, acc + 1) else steps(b * 3 + 1, acc + 1) } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"exceptioned","published_at":"2021-08-12T12:37:47.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"RGlossop"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/RGlossop","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"f7a1feb53f1b46c39faecbcde1981688","snippet":"object CollatzConjecture { def steps(n: Int): Option[Int] = if (n <= 0) None else if (n == 1) Some(0) else if(n % 2 == 0) steps(n / 2).map(_ + 1) else steps(n * 3 + 1).map(_ + 1) }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-03-08T09:52:20.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"HegelPro"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/HegelPro","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"f786944f3f504e7f81050912b668e486","snippet":"object CollatzConjecture { def steps(n: Int)(implicit current: Int = 0): Option[Int] = n match { case x if x == 1 => Some(current) case x if x > 1 => steps(if (x % 2 == 0) x/2 else 3*x + 1)(current + 1) case _ => None } }","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":7,"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":"revck"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/revck","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"598003ac04e94e9e86c67c8ff19550aa","snippet":"object CollatzConjecture { /** Computes the number of steps (either dividing by two, or multiplying by * three then adding one) for a number to reach 1 using the procedure in * the Collatz conjecture. * * @param startVal The number to start the process with. * @return Some(number of steps) if startNum is positive * None otherwise */ def steps(startVal: Int): Option[Int] = ","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":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"theemathas"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/theemathas","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"80cb5eb021f0411c8d8ec68ed2e730d0","snippet":"object CollatzConjecture { def steps(num: Int): Option[Int] = { if (num > 0) { var count = 0 var start = num while (start > 1) { count += 1 start = start match { case n if n % 2 == 0 => n / 2 case m if m % 2 != 0 => (3 * m) + 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"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":"rooftopsparrow"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/rooftopsparrow","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"229424132d4d447f99fdcb53d09c5f55","snippet":"object CollatzConjecture { def steps(n: Long): Option[Int] = if (n < 1) { None } else if (n == 1) { Some(0) } else if (n % 2 == 0) { steps(n / 2).map(_ + 1) } else { steps(n * 3 + 1).map(_ + 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"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":"dbalmain"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/dbalmain","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"ca006b2e909346a39242cead181240fe","snippet":"object CollatzConjecture { def steps(input: Int): Option[Int] = loop(input,0) def loop (input:Int, count:Int) : Option[Int] = input match { case 1 => Some(count) case n if n <= 0 => None case n if n % 2 == 0 => loop(n/2,count+1) case n => loop(3*n+1, count+1) } }","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":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"chakravarthiponmudi"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/chakravarthiponmudi","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"efee950e68ff4b48aceec7fc14f689f5","snippet":"import scala.annotation._ object CollatzConjecture{ @tailrec def steps(n: Int, cont : Option[Int] = Some(0)): Option[Int] = n match{ case 1 => cont case x if n <= 0 => None case _ => { val num =if(n % 2 == 0) n / 2 else (3 * n) + 1 steps(num,Some(cont.get + 1)) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"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":"jmlb23"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/jmlb23","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"faeb88ef47c54272b34116250d7d8b25","snippet":"object CollatzConjecture { def steps(n: Int) : Option[Int] = if (n < 1) None else Some(steps(n, 0)) private[this] def steps(n: Int, acc: Int) : Int = { val next : Int = if (n % 2 == 0) n / 2 else 3 * n + 1 if (n == 1) acc else steps(next, acc + 1) } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":7,"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":"3mpr"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/3mpr","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"7b46ca9920264a49b7c90e87979ae9e9","snippet":"object CollatzConjecture { @annotation.tailrec def steps(n:Int,acc:Int=0):Option[Int] = { if (n<1) None else if (n==1) Some(acc) else if (n%2==0) steps(n/2, acc+1) else steps(n*3+1, acc+1) } ","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":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"dacr"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/dacr","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"422c2e4d5ab64cd48556f3cc81689301","snippet":"object CollatzConjecture { def steps(i : Int): Option[Int] ={ findNumberOfSteps(i) } def findNumberOfSteps(i : Int, counter: Int =0):Option[Int] = i match { case 1 => Some(counter) case a if a < 1 => None case _ => if(i % 2 == 0) findNumberOfSteps(i/2, counter + 1) else findNumberOfSteps((i * 3) + 1, counter + 1) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"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":"matthewn94"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/matthewn94","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"7ee1213f037d4a9fb9660410eb6abe9f","snippet":"object CollatzConjecture { def next(n: Int) = n match { case _ if n % 2 == 0 => n / 2 case _ => 3*n + 1 } def steps(n: Int): Option[Int] = n match { case _ if n < 1 => None case 1 => Some(0) case _ => Some(1 + steps(next(n)).get) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"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":"ryanbloom"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/ryanbloom","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"7f3603f07f104a1da2f38e9a50ee0b41","snippet":"import scala.annotation.tailrec object CollatzConjecture { @tailrec def steps(numberToCollatz: Int, numSteps : Int = 0) : Option[Int] = { if(numberToCollatz <=0) { None ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"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":"avramirez"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/avramirez","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"8888a00dd14f4abdb87450dbc0098055","snippet":"object CollatzConjecture { private def reqStep(n: Int, x: Int): Option[Int] = x match { case x if x < 1 => None case x if x == 1 => Some(n) case x if x % 2 == 0 => reqStep(n + 1, x / 2) case _ => reqStep(n + 1, 3 * x + 1) } def steps(x: Int): Option[Int] = reqStep(0, x) }","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":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"antoinegauvain"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/antoinegauvain","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"36883601364145f2bbdc51005d77fd64","snippet":"import scala.annotation.tailrec object CollatzConjecture { val isNaturalEven: (Int => Boolean) = i => (i % 2) == 0 && i > 0 val isNaturalOdd: (Int => Boolean) = i => (i % 2) > 0 && i > 0 val whenEven: (Int => Int) = n => n / 2 val whenOdd: (Int => Int) = n => (3*n) + 1 def steps(x: Int, acc: Int = 0): Option[Int] = { ","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":"exceptioned","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"3dcgithub"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/3dcgithub","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"039bea24568e4ecfb679bc014b148f81","snippet":"object CollatzConjecture { private def steps_count(i: Int, counter: Int): Int = i match { case 1 => counter case n if n % 2 == 0 => steps_count(n/2, counter + 1) case n if n % 2 != 0 => steps_count(3*n + 1, counter + 1) } def steps(i: Int): Option[Int] = i match { case 0 => None ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"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":"andrix"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/andrix","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"8a527fa93a1e43e5812018d73d9978bb","snippet":"object CollatzConjecture { @annotation.tailrec def fun(steps: Int, n: Int): Option[Int] = n match { case 1 => Some(steps) case _ if n < 1 => None case _ => fun(steps+1, if (n % 2 == 0) n / 2 else 3 * n + 1) } def steps(n: Int): Option[Int] = fun(0, n) }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":9,"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":"sjexercism"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/sjexercism","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"1968808e1d8c4e9492271bca0ff8b3cd","snippet":"object CollatzConjecture { def steps(n: Int): Option[Int] = { if (n < 1) return None var steps = 0 var i = n ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"exceptioned","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"jakjohnson"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/jakjohnson","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"b61fadf3f1524e68a9a75b50855a843b","snippet":"object CollatzConjecture { def steps(i: Int, numSteps : Int = 0) : Any = { i match { case x if x < 1 => None case 1 => Some(numSteps) case x if x % 2 == 0 => steps(x/2, numSteps+1) case x => steps(3*x+1, numSteps+1) } } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":10,"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":"tomathrux"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/tomathrux","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"bef785b824fe4a93aad300e4fcfe4612","snippet":"import scala.annotation.tailrec object CollatzConjecture { @tailrec private [this] def step(seed: BigInt)(count: BigInt): (BigInt, BigInt) = { seed match { case one if seed == 1 => BigInt(1) -> count case even if seed % 2 == 0 => step(even / 2)(count + 1) case odd => step(odd * 3 + 1)(count + 1) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":17,"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":"drewfead"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/drewfead","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}},{"uuid":"d67ecb4105834807ac1e387c198d1f54","snippet":"object CollatzConjecture extends App { def steps(number: Int): Option[Int] = number match { case n: Int if n < 1 => None case 1 => Some(0) case n: Int if n % 2 == 0 => steps(n / 2).map(_ + 1) case _ => steps(3 * number + 1).map(_ + 1) } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":8,"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":"gmiotto"},"exercise":{"title":"Collatz अनुमान","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/solutions/gmiotto","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/collatz-conjecture/iterations"}}],"meta":{"current_page":1,"total_count":695,"total_pages":29,"unscoped_total":695}}}}}

भाषा ट्रैक

Jiki के साथ कोड करना सीखिए

आपकी यात्रा

आपके पसंदीदानया

Exercism के खास फायदे

कम्युनिटी वीडियो

संक्षिप्त परिचय शृंखला

इंटरव्यू और कहानियाँ

Discord

फोरम

शुरुआत करें

मेंटर बनें

डॉक्स

योगदानकर्ता

अनुवादकनया

दान करें

Exercism के बारे में

हमारा प्रभाव

GitHub सिंकरनया

इनसाइडर्स