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.
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 4 5 6 7 8 |
object HelloWorldNTimes extends App { def f2(i: Int): Unit = println("Hello World") def f(n: Int) = (1 to n).foreach(f2(_)) var n = readInt f(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 |
object HelloWorld extends App { def f() = println("Hello World") f() } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 4 5 |
object SolveMeFirst { def main(args: Array[String]) { println(io.Source.stdin.getLines().take(2).map(_.toInt).sum) } } |
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 |
void Print(Node head) { while(head != null) { System.out.println(head.data); head = head.next; } } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution Make 2 sums for 2 diagonals – from left to right, from right to left. Substract 2 sums and print its absolute value. I created solution in 4 languages: Scala Java JavaScript Ruby All solutions are also available on my GitHub. Scala […]