Hackerrank organized another programming contests from 23.10.2015 17:30 CEST to 25.10.2015 CET called Ad Infinitum 13 – Math Programming Contest, which I participaded in. It was my 12th contest at Hackerrank and I think I was quite successfull. I was able to solve 3 challenges and earned full points: Game with coins Integral Points The […]
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |
object EvaluatingEx extends App { def f(x: Double): Double = { f2(x, 9) } def fact(x: Int): Int = if (x <= 1) 1 else x * fact(x - 1) def f2(x: Double, i: Int): Double = { if (i == 0) 1 else Math.pow(x, i) / fact(i) + f2(x, i - 1) } val n = readInt (1 to n) foreach (x => println(f(readFloat()))) } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 4 |
object UpdateList extends App { def f(arr: List[Int]): List[Int] = if (arr.isEmpty) Nil else arr.head.abs :: f(arr.tail) } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 4 5 6 7 8 9 10 |
object ListLength extends App { def f(arr: List[Int]): Int = { var count = 0 for (i <- arr) count += 1 count } println(f(io.Source.stdin.getLines.toList.map(_.trim).map(_.toInt))) } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 |
object SumOddElements extends App{ def f(arr:List[Int]):Int = arr.filter(_ % 2 != 0).sum } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 4 |
object ReverseList extends App { def f(arr: List[Int]): List[Int] = (arr.foldLeft(List.empty[Int])((list, e) => e :: list)) } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 4 5 6 7 |
object ArrayOfN extends App { def f(num: Int): List[Int] = (1 to num).toList println(f(readInt).length) } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 4 5 6 7 8 9 10 |
object FilterPositions extends App { def f(arr: List[Int]): List[Int] = arr match { case x :: y :: l => y :: f(l) case x :: y => y case Nil => Nil } println(f(io.Source.stdin.getLines.toList.map(_.trim).map(_.toInt)).mkString("\n")) } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 4 5 6 7 8 |
object FilterArray extends App { def f(num: Int, arr: List[Int]): List[Int] = arr.filter(_ < num) var lines = io.Source.stdin.getLines.toList println(f(lines(0).toInt, lines.map(_.trim).map(_.toInt)).map(_.toString).mkString("\n")) } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
object ListReplication extends App { def f(num: Int, arr: List[Int]): List[Int] = if (arr.isEmpty) Nil else List.fill(num)(arr.head) ::: f(num, arr.tail) def f2(num: Int, arr: List[Int]): List[Int] = arr match { case x :: xs => List.fill(num)(x) ::: f2(num, xs) case Nil => Nil } def displayResult(arr: List[Int]) = println(f(arr(0).toInt, arr.drop(1)).map(_.toString).mkString("\n")) displayResult(io.Source.stdin.getLines.toList.map(_.trim).map(_.toInt)) } |
Solution also available on my GitHub.