Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution There are two checks: I checked if is less then and immediatelly print “NO”. That means, kangaroo 1 would be never able to reach kangaroo 2. I calculated differences between kangaroo positions and their […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I checked each consequent combination of (i, j, k), if it is valid according to condition. There is a catch. I had to stop an iteration if array[j] – array[i]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I calculated time in the cycle when counter value is 1: last_time_next_cycle = actual_cycle_time + 2 * (last_time_actual_cycle – last_time_previous_cycle). The difference in seconds between cycle 0 and cycle 1 is 3, which is always like that. For a given […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Create index pairs variations for all indexes that pair is unique – it means when (i, j) exists (j, i) is the same. For each pair calculate the sum of values at corresponding index. If is divisible, count them and […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution There are 2 options To split the string by regular expression”[A-Z]” and then print the length of an array returned from splitting. To iterate over all characters, count the uppercase and print their count + 1 I created solution in: […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Read all ratings and compare it according to the defined conditions: If ai > bi, then Alice is awarded 1 point If ai < bi, then Bob is awarded 1 point If ai = bi, then neither person receives a […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Contiguous sum – using Kadane’s algorithm Non-contiguous sum – filter all positive elements from given array and sum them. If this array is empty. Take the greatest element. I created solution in: Scala Java JavaScript Ruby All solutions are also […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Check if for a given value x is always only one function output value y. See function definition. I created solution in: Scala All solutions are also available on my GitHub. Scala
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
import scala.io.Source object FunctionOrNot extends App { val lines = Source.stdin.getLines().toList val tests = lines.head.toInt val parts = lines.tail.partition(!_.contains(" ")) val counts = parts._1.map(_.toInt) val pairs = parts._2.map(_.split(" ")).map(arr => Tuple2(arr(0).toInt, arr(1).toInt)) var start = 0 counts.foreach { i => { val p = pairs.slice(start, start + i) start = start + i println(if(isFunction(p)) "YES" else "NO") } } def isFunction(rel: List[(Int, Int)]): Boolean = { val groupByX = rel.groupBy(_._1) val filteredMoreThanOne = groupByX.filter(p => p._2.size > 1) filteredMoreThanOne.forall(_._2.map(_._2).distinct == 1) } } |
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution For every input line: divide into character pairs reverse order of characters concat the pairs it into the one string I created solution in: Scala All solutions are also available on my GitHub. Scala
|
1 2 3 4 5 |
object StringOPermute extends App { val lines = Source.stdin.getLines().drop(1) val linePairs = lines.map(_.grouped(2).map(_.reverse).toList.flatten) println(linePairs.mkString("\n")) } |
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Iterate through one of the strings and concatenate each actual character. I created solution in: Scala All solutions are also available on my GitHub. Scala
|
1 2 3 4 5 6 7 8 9 10 |
import scala.io.Source object StringMingling extends App { val lines = Source.stdin.getLines().toList val p = lines.head val q = lines.tail.head val mingled = p.indices.map(i => p(i) + "" + q(i)).mkString("") println(mingled) } |