{"request":{"endpoint":"https://exercism.org/api/v2/tracks/scala/exercises/nth-prime/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"92a79884c1224359b5a00d43f7466f7d","snippet":"object NthPrime { val primes: Stream[Int] = 2 #:: Stream.from(3, 2).filter(isPrime) def isPrime(number: Int): Boolean = primes.takeWhile(_ <= math.sqrt(number)).forall(number % _ != 0) def prime(n: Int): Option[Int] = n match { case 0 => None case _ => Some(primes.take(n).last) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"exceptioned","published_at":"2019-08-26T23:26:53.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"SergiiVlasiuk"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/SergiiVlasiuk","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"8fa5d3d5158c4614907dbb2c26a0eca3","snippet":" object NthPrime{ def prime(n: Int): Option[Int] = if (n < 1) None else Some(Stream.from(1).filter(isPrime)(n)) private def isPrime(n: Int) = 2.to(math.sqrt(n).toInt).count(n % _ == 0) == 0 }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":4,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-12-17T18:14:24.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"NovemberTang"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/NovemberTang","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"0400064bebdd4d5db7a2163a0fc850b2","snippet":"object NthPrime { val primes: Stream[Int] = 2 #:: Stream.from(3).filter(candidate => primes.takeWhile(it => it * it <= candidate).forall(candidate % _ > 0)) def prime(n: Int): Option[Int] = primes.take(n).toVector.lastOption }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":4,"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":"dadrox"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/dadrox","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"44a5c959a4404e05871725f44834afcb","snippet":"import scala.annotation.tailrec object NthPrime { def prime(n: Int): Option[Int] = { def isPrime(n: Int): Boolean = { !(2 until n).exists(n % _ == 0) } @tailrec ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"exceptioned","published_at":"2018-10-15T15:34:18.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"michaeldperez"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/michaeldperez","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"6ae7a2c4786e4ed0b067c4274f774998","snippet":"object NthPrime { private val Primes = Stream.from(2).filter(isPrime) private def isPrime(n: Int): Boolean = (2 to math.sqrt(n.asInstanceOf[Double]).asInstanceOf[Int]).forall(n % _ != 0) def prime(n: Int): Option[Int] = if (n < 1) None else Some(Primes.drop(n - 1).head) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-05-25T14:56:11.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"tinnuir"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/tinnuir","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"0141ae5a924c4ce9adb5db6a2233fd5e","snippet":"import scala.annotation.tailrec object NthPrime { def prime(num: Int): Option[Int] = { var list: List[Int] = List(2, 3) @tailrec def nextPrime(idx: Int): Int = { if (!list.takeWhile(elem => Math.sqrt(idx)>=elem).exists(elem => idx % elem == 0)) list = list.:+(idx) if (list.length == num) list.last ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-07-08T07:23:29.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"Rados13"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/Rados13","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"a4f57e35aa3148349aa12149dcb68f48","snippet":"import scala.collection.mutable.ListBuffer object NthPrime { def prime(n:Int):Option[Int]={ if (n<1) return None var primes= new ListBuffer[Int]() primes+= 2 var candidate:Int=3 while (primes.length < n) { ","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":"exceptioned","published_at":"2021-07-06T16:33:13.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"agc"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/agc","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"13ceca7824f2482ca6df5170217c445b","snippet":"object NthPrime{ def prime(n:Int):Option[Int] = { @scala.annotation.tailrec def loop(i:Int, primes:List[Int]):Option[Int] = { if(primes.length == n) primes.lastOption else if(primes.forall(p => i % p != 0)) loop(i + 1, primes :+ i) else loop(i + 1, primes) } n match { case n if n < 1 => None ","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":"exceptioned","published_at":"2020-07-10T04:38:12.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"R4ncid"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/R4ncid","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"3bdfd6c90e37458a9cf4a31104539f88","snippet":"import scala.util.control.Breaks.{break, breakable} object NthPrime { def prime(nth: Int): Option[Int] = { if (nth < 1) { None } else { var currentN: Int = 1 var currentNumber = 2 while (currentN < nth) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-12-15T17:37:43.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"txlee1"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/txlee1","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"1585d72ef2884805986be29771b04ae0","snippet":"object NthPrime { def prime(n: Int): Option[Int] = { def primes(numbers: Stream[Int] = Stream.from(2)): Stream[Int] = numbers match { case head #:: tail => head #:: primes(tail.filter(_ % head != 0)) } primes().take(n).lastOption } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"exceptioned","published_at":"2021-11-02T13:05:59.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"tombeck"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/tombeck","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"127369e32ad5487abd9c377b79aaa918","snippet":"import scala.annotation.tailrec object NthPrime { def prime(n: Int): Option[Int] = { if (n <= 0) return None @tailrec def next(acc: List[Int], c: Int): Int = { if (acc.size > c - 1) return acc(c - 1) ","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":"2022-01-23T20:01:07.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"piotrkoper"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/piotrkoper","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"507a09049b23477c91b81834a29f89c0","snippet":"import scala.collection.mutable.Stack object NthPrime { def prime(num: Int): Option[Int] = { val primes = Stack[Int]() if (num >= 1) primes.push(2) var count = 3 while (primes.size < num) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"exceptioned","published_at":"2022-05-10T20:08:07.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"byrdaffinity"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/byrdaffinity","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"502f2d89c6dc48569a9ae9201638c13f","snippet":"import scala.annotation.tailrec object NthPrime { def isPrime(x: Int): Boolean = { (2 to math.ceil(math.sqrt(x)).toInt).map(f => x % f != 0) .forall(notADivisor => notADivisor) } || x == 2 @tailrec ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-12-28T15:53:22.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"NyriiX"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/NyriiX","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"fe026ee6361e41f18ef2bdcf50cc946b","snippet":"import scala.math._ object NthPrime { private def isPrime(n: Int): Boolean = n match { case 2 => true case _ if n % 2 == 0 => false case _ => potentialDivisorsRange(n).forall(notDivides(n)) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-20T17:07:19.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"mucciolo"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/mucciolo","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"15858e6186f848a6b7034e97cff1a8e7","snippet":"/** https://exercism.org/tracks/scala/exercises/nth-prime */ object NthPrime: /** Return 1-based nth prime, if any. */ def prime(n: Int): Option[Int] = if (n <= 0) { return None } else if (n == 1) { return Some(2) } else if (n == 2) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-01-24T02:22:46.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"FranklinChen"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/FranklinChen","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"897d6cd67f0a4a3da25326dff029c1e5","snippet":"object NthPrime { def prime(n: Int): Option[Int] = { if (n <= 0) None else { def isPrime(num: Int): Boolean = { if (num == 2) true else !(2 until num).exists(x => num % x == 0) } Some(Stream.from(2).filter(isPrime).drop(n - 1).head) ","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":"2024-03-11T23:39:10.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"mjholub"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/mjholub","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"0cfa735d59c54ef98073955d1df30d9a","snippet":"import scala.annotation.tailrec object NthPrime { private def isPrime(n: Integer): Boolean = { @tailrec def loop(n: Integer, div: Integer): Boolean = { if (div > n / 2) true else if (n % div == 0) false else loop(n, div + 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-03T14:05:29.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"Chufretalas"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/Chufretalas","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"a19481159675485bafb049d13db91610","snippet":"object NthPrime: val initPrimes = List(29,23,19,17,13,11,7,5,3,2) def prime(n: Int): Option[Int] = if n <= 0 then None else Some{ val xs = primes(n, 30+1, initPrimes) // could compute n+1 primes, or n < initPrimes.length xs(xs.length - n) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-09-29T00:53:34.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"dancewithheart"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/dancewithheart","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"d3bd74bb662f445584435ec2aa41a8a3","snippet":"object NthPrime { lazy val primes: LazyList[Int] = 2 #:: LazyList.from(3).filter(i => primes.takeWhile(j => j * j <= i).forall(k => i % k > 0)) def prime(n: Int): Option[Int] = n match { case 0 => None case _ => Some(primes.take(n).last) } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-02-04T14:33:38.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"Whistyfly"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/Whistyfly","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"dbd49cc618704ddc90bca18c1a5bb788","snippet":"object NthPrime { def isPrime(num: Int): Boolean = { if (num < 2) false else !Range(2, Math.sqrt(num).toInt + 1).exists(x => num % x == 0) } def prime(n: Int): Option[Int] = { def nthPrime(count: Int, num: Int): Int = { count match { case u if isPrime(num) && u+1==n => num ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-07-01T16:13:10.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"dineshjani"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/dineshjani","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"0586e499c7ec43cbbeef9c98eedb77cc","snippet":"import scala.annotation.tailrec object NthPrime: def prime(n: Int): Option[Long] = @tailrec def loop(nums: Iterator[Long], distance: Int): Long = val nextPrime = nums.next() if distance == 1 then nextPrime else loop(nums.filter(_ % nextPrime != 0), distance - 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":"2025-04-30T15:25:58.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"michael-camacho"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/michael-camacho","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"43c90923758149c58851e879df460b48","snippet":"object NthPrime { def prime(n: Int): Option[Int] = n match { case n if n <= 0 => None case _ => Some(nThPrime(n)) } def nThPrime(n: Int): Int = { var lastPrimeIdx = 0 for ( el <- 2 to Int.MaxValue ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-09-09T11:06:34.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"lorgath"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/lorgath","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"23f8a3bb87ce44999746448f86b1d5a5","snippet":"object NthPrime { private def isPrime(num: Int): Boolean = (2 until num).find(num % _ == 0) match { case Some(_) => false case None => true } @annotation.tailrec private def prime(n: Int, current: Int): Option[Int] = { if (isPrime(current)) if (n <= 1) Some(current) else prime(n - 1, current + 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-01-17T11:53:19.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"domodro"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/domodro","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}},{"uuid":"af22c843b966484ca9dbdfba5d0b4691","snippet":"import scala.annotation.tailrec object NthPrime { def prime(N: Int): Option[Int] = { @tailrec def rec(p: Int, n: Int, xs: List[Int]): Option[Int] = { def isPrime(p: Int): Boolean = p == 2 || (xs.nonEmpty && xs.forall(x => p % x != 0)) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-10-31T22:56:43.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"micpez"},"exercise":{"title":"nवाँ अभाज्य","icon_url":"https://assets.exercism.org/exercises/nth-prime.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/nth-prime/solutions/micpez","private_iterations_url":"https://exercism.org/hi/tracks/scala/exercises/nth-prime/iterations"}}],"meta":{"current_page":1,"total_count":155,"total_pages":7,"unscoped_total":155}}}}}

भाषा ट्रैक

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

आपकी यात्रा

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

Exercism के खास फायदे

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

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

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

Discord

फोरम

शुरुआत करें

मेंटर बनें

डॉक्स

योगदानकर्ता

अनुवादकनया

दान करें

Exercism के बारे में

हमारा प्रभाव

GitHub सिंकरनया

इनसाइडर्स