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 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 […]
Problem Statement A description of the problem can be found on Hackerrank. Solution Create n times a line consting of spaces (‘ ‘) and hashes (‘#’). Each line contains incremented count of hashes and decremented count of spaces form 1 to n, respectively n downto 1. I created solution in 4 languages: Scala Java JavaScript […]
Problem Statement A description of the problem can be found on Hackerrank. Solution
|
1 2 3 |
object StringReductions extends App { println(io.Source.stdin.getLines().toList.head.distinct) } |
Solution also available on my GitHub.
Problem Statement A description of the problem can be found on Hackerrank. Solution After reading all numbers in array, you have to filter this array according to three conditions – number greater than zero, lower then zero and equals to zero. Count the subarrays and divide by array length. I created solution in 4 languages: […]
Problem Statement A description of the problem can be found on Hackerrank. Solution I created recursive function for factorial . Then create all combinations of rows and column indexes. For input 4 it looks like:
|
1 2 3 4 |
(0,0) (1,0), (1,1) (2,0), (2,1), (2,2) (3,0), (3,1), (3,2), (3,3) |
Apply function for pascal triangle for each combination. I created solution in Scala: The solution […]
This is a summary post of first Hackerrank intruductory challenges – Solve me first, Solve me second. It is only required to select your favourite programming language. You get a template and just submit this code. Both solutions: Solve me first Solve me second Also available on my GitHub here and here. Solve me first […]
Problem Statement A description of the problem can be found on Hackerrank. Solution Read from input and sum all numbers. Same as Simple Array Sum, but you have to use bigger integer type as 32-bit integer if language does not support automatic conversion to Big Integers as default I created solution in 4 languages: Scala […]