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 Until the sticks array is empty: print the length of sticks array sort the array get the minimum value as first element of the array cut the array filtering only values greater than minimum I created solution in: Scala Java […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution We have to prevent timeout, because there is big upper constraint. For a given numbers a and b we can find out all square numbers with formula: . There is a special case when a and b are […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Iterate from p to q and check if actual number Kaprekar number (the addition of 2 parts of squared number is equal to actual number) I created solution in: Scala Java JavaScript Ruby All solutions are also available on my […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Count all students which come before starting a class (their arrival time is lower or equal to 0). Check if the count of the students is lower than cancellation threshold. I created solution in: Scala Java JavaScript Ruby All solutions […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Take all problems for each chapter. Fill the pages according to rules – each page contains only k problems, or less if chapter ends. Start counting chapter problems from 1. Check if page contains problem with same number. I created […]
Problem Statement A description of the problem can be found on Hackerrank. Solution Create a function for encrypting which takes a cipher shift as parameter as well. Check if incoming character is letter. If is lower case encrypt it using ascii number: to_char[ascii_of_char – asci_of_a + shift) % 26 + ascii_of_a]. Similar if letter is […]
Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
import java.util.*; public class ArraysDS { public static void main(String[] args) { Scanner stdin = new Scanner(System.in); int length = stdin.nextInt(); int[] array = new int[length]; for(int i = 0; i < length; i++) { array[i] = stdin.nextInt(); } for(int i = length - 1; i >= 0; i--) { System.out.print(array[i] + " "); } stdin.close(); } } |
JavaScript
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
'use strict'; const processData = input => { let lines = input.split('\n'); let l = parseInt(lines[0]); let array = lines[1].split(' ').map(item => parseInt(item)); let reversed = []; for(let i = l - 1; i >= 0; i--) { reversed.push(array[i]); } console.log(reversed.join(" ")); }; process.stdin.resume(); process.stdin.setEncoding("ascii"); var _input = ""; process.stdin.on("data", input => _input += input); process.stdin.on("end", () => processData(_input)); |
Scala
|
1 2 3 4 5 6 7 8 9 10 11 12 |
object ArraysDS { def main(args: Array[String]) { val sc = new java.util.Scanner (System.in) var n = sc.nextInt() var arr = new Array[Int](n) for(arr_i <- 0 to n-1) { arr(arr_i) = sc.nextInt() } println(arr.reverse.mkString(" ")) } } |
Ruby
|
1 2 3 4 |
n = gets.strip.to_i arr = gets.strip arr = arr.split(' ').map(&:to_i) puts arr.reverse.join(" ") |
Problem Statement A description of the problem can be found on Hackerrank. Solution Regex: [A-Z]{5}\d{4}[A-Z] I created solution in: Ruby Java JavaScript Scala All solutions are also available on my GitHub. Ruby
|
1 2 3 4 5 6 7 8 9 |
tests = gets.chomp.to_i tests.times do input = gets.chomp.to_s if input =~ /[A-Z]{5}\d{4}[A-Z]/ puts "YES" else puts "NO" end end |
Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
import java.util.*; public class ValidPanFormat { private static final String PAN = "[A-Z]{5}\\d{4}[A-Z]"; public static void main(String[] args) { Scanner stdin = new Scanner(System.in); int tests = Integer.parseInt(stdin.nextLine()); for(int i = 0; i < tests; i++) { System.out.println(isPan(stdin.nextLine())); } stdin.close(); } private static String isPan(String s) { if(s.matches(PAN)) { return "YES"; } else { return "NO"; } } } |
JavaScript
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 |
'use strict'; const PAN = /[A-Z]{5}\d{4}[A-Z]/; const processData = input => { let lines = input.split('\n').slice(1); let isPan = s => { if(s.match(PAN)) { return "YES"; } else { return "NO"; } }; console.log(lines.map(isPan).join('\n')); }; process.stdin.resume(); process.stdin.setEncoding("ascii"); var _input = ""; process.stdin.on("data", input => _input += input); process.stdin.on("end", () => processData(_input)); |
Scala
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 |
import scala.io.Source object ValidPanFormat extends App { private[this] val PAN = "[A-Z]{5}\\d{4}[A-Z]" val lines = Source.stdin.getLines().drop(1) val pans = lines.map(isPan) println(pans.mkString("\n")) def isPan(s: String): String = { if(s.matches(PAN)) { "YES" } else { "NO" } } } |