Archives scala - Page 12 of 15

Hackerrank – Connecting Towns

Problem Statement A description of the problem can be found on Hackerrank. Solution Count of all routes as multiplication of routes between towns. I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. Java

import java.util.Scanner;

public class ConnectingTowns {
    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int cases = stdin.nextInt();
        for(int i = 0; i < cases; i++) {
            int l = stdin.nextInt();
            int routes = 1;
            for(int j = 0; j < l - 1; j++) {
                routes *= stdin.nextInt();
                routes %= 1234567;
            }
            System.out.println(routes);
        }
        stdin.close();
    }
}

import java.util.Scanner;

public class ConnectingTowns {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int cases = stdin.nextInt();

for(int i = 0; i < cases; i++) {

int l = stdin.nextInt();

int routes = 1;

for(int j = 0; j < l - 1; j++) {

routes *= stdin.nextInt();

routes %= 1234567;

}

System.out.println(routes);

}

stdin.close();

}

JavaScript

function processData(input) {
    var lines = input.split('\n');
    var n = parseInt(lines[0]);
    var index = 2;
    for(var i = 0; i < n; i++) {
        var arr = lines[index].split(" ").map(i => parseInt(i));
        var routes = 1;
        for(var j = 0; j < arr.length; j++) {
            routes *= arr[j];
            routes %= 1234567;
        }
        console.log(routes);
        index += 2;
    }
}

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
    _input += input;
});

process.stdin.on("end", function () {
    processData(_input);
});

function processData(input) {

var lines = input.split('\n');

var n = parseInt(lines[0]);

var index = 2;

for(var i = 0; i < n; i++) {

var arr = lines[index].split(" ").map(i => parseInt(i));

var routes = 1;

for(var j = 0; j < arr.length; j++) {

routes *= arr[j];

routes %= 1234567;

}

console.log(routes);

index += 2;

}

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

process.stdin.on("data", function (input) {

_input += input;

});

process.stdin.on("end", function () {

processData(_input);

});

Scala

import scala.io.Source

object ConnectingTowns extends App {
  val lines = Source.stdin.getLines().drop(1)
  val routesArray = lines.toList.filter(_.contains(" "))
  val routes = routesArray.map(_.split(" ").map(_.toLong).foldLeft(1L)(_ * _ % 1234567))
  println(routes.mkString("\n"))
}

import scala.io.Source

object ConnectingTowns extends App {

val lines = Source.stdin.getLines().drop(1)

val routesArray = lines.toList.filter(_.contains(" "))

val routes = routesArray.map(_.split(" ").map(_.toLong).foldLeft(1L)(_ * _ % 1234567))

println(routes.mkString("\n"))

}

Ruby

cases = gets.chomp.to_i
cases.times do
  result = 1
  towns = gets.chomp.to_i
  routes = gets.chomp.split.map { |e| e.to_i }
  for i in 0..towns - 2 do
    result *= routes[i]
    result %= 1234567
  end
  puts result 
end

cases = gets.chomp.to_i

cases.times do

result = 1

towns = gets.chomp.to_i

routes = gets.chomp.split.map { |e| e.to_i }

for i in 0..towns - 2 do

result *= routes[i]

result %= 1234567

end

puts result

end

Hackerrank – Computing the GCD

Problem Statement A description of the problem can be found on Hackerrank. Solution I used Euclid’s algorithm for computing Greatest Common Divisor. I created solution in: Scala All solutions are also available on my GitHub. Scala

object ComputingGcd {
    
   def gcd(x: Int, y: Int): Int =
   {
     if(y == 0) x else gcd(y, x % y)
   }
  

   /**This part handles the input/output. Do not change or modify it **/
  def acceptInputAndComputeGCD(pair:List[Int]) = {
      println(gcd(pair.head,pair.reverse.head))
  } 

    def main(args: Array[String]) {
/** The part relates to the input/output. Do not change or modify it **/
         acceptInputAndComputeGCD(readLine().trim().split(" ").map(x=>x.toInt).toList)

    }
}

object ComputingGcd {

def gcd(x: Int, y: Int): Int =

{

if(y == 0) x else gcd(y, x % y)

}

/**This part handles the input/output. Do not change or modify it **/

def acceptInputAndComputeGCD(pair:List[Int]) = {

println(gcd(pair.head,pair.reverse.head))

}

def main(args: Array[String]) {

/** The part relates to the input/output. Do not change or modify it **/

acceptInputAndComputeGCD(readLine().trim().split(" ").map(x=>x.toInt).toList)

}

Hackerrank – Closest Numbers

Problem Statement A description of the problem can be found on Hackerrank. Solution Sort the input array ascending. For element at index i do difference with element at index i+1. Find the minimum difference. Check all elements and find all pair that have this minimum difference. Print found elements ascending. I created solution in: Java […]

Hackerrank – B’day Gift

Problem Statement A description of the problem can be found on Hackerrank. Solution Sum all elements. The result is sum / 2. I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. Java

import java.util.*;

public class BdayGift {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = stdin.nextInt();
        long sum = 0;
        for(int i = 0; i < tests; i++) {
            sum += stdin.nextInt();
        }
        System.out.format("%.1f", (double) sum / 2);
        stdin.close();
    }
}

import java.util.*;

public class BdayGift {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

long sum = 0;

for(int i = 0; i < tests; i++) {

sum += stdin.nextInt();

}

System.out.format("%.1f", (double) sum / 2);

stdin.close();

}

JavaScript

'use strict';

var _ = require('lodash');

const processData = input => {
    let arr = input.split('\n').slice(1).map(i => parseInt(i))
    let sum = _.sum(arr);
    console.log((sum / 2) + (sum % 2 == 0 ? '.0' : ''));
};

process.stdin.resume();
process.stdin.setEncoding("ascii");

var _input = "";
process.stdin.on("data", input => _input += input);
process.stdin.on("end", () => processData(_input));

'use strict';

var _ = require('lodash');

const processData = input => {

let arr = input.split('\n').slice(1).map(i => parseInt(i))

let sum = _.sum(arr);

console.log((sum / 2) + (sum % 2 == 0 ? '.0' : ''));

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

process.stdin.on("data", input => _input += input);

process.stdin.on("end", () => processData(_input));

Scala

import scala.io.Source

object BdayGift extends App {
  val lines = Source.stdin.getLines().drop(1).map(_.toLong)
  printf("%.1f", lines.sum.toDouble / 2)
}

import scala.io.Source

object BdayGift extends App {

val lines = Source.stdin.getLines().drop(1).map(_.toLong)

printf("%.1f", lines.sum.toDouble / 2)

}

Ruby

balls = gets.chomp.to_i
expected_num = 0
balls.times do
  input = gets.chomp.to_i
  expected_num += input
end
expected_num /= 2.0
puts "#{format('%.1f', expected_num)}"

balls = gets.chomp.to_i

expected_num = 0

balls.times do

input = gets.chomp.to_i

expected_num += input

end

expected_num /= 2.0

puts "#{format('%.1f', expected_num)}"

Hackerrank – Anagram

Problem Statement A description of the problem can be found on Hackerrank. Solution Divide the input string into two halves. Count all common character in the halves. A result is difference between length of the one half and count of the common characters. Different solution deletes common characters from the second half. The result is […]

Hackerrank – Alternating Characters

Problem Statement A description of the problem can be found on Hackerrank. Solution Iterate through all string characters. If actual character i is different then character i-1 then use character i for next comparison. If they are not equal increment a deletion counter. Print the value of the counter. I created solution in: Java JavaScript […]

Hackerrank – Alien Username

Problem Statement A description of the problem can be found on Hackerrank. Solution Regular Expression that validates input username: ^[_\.]\d+[a-zA-Z]*_?$ I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. Java

import java.util.Scanner;

public class AlienUsername
{
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int testCases = scanner.nextInt();
        for (int i = 0; i < testCases; i++)
        {
            String input = scanner.next();
            if(input.matches("[_\\.]\\d+[a-zA-Z]*_?"))
            {
                System.out.println("VALID");
            }
            else
            {
                System.out.println("INVALID");
            }
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class AlienUsername

{

public static void main(String[] args)

{

Scanner scanner = new Scanner(System.in);

int testCases = scanner.nextInt();

for (int i = 0; i < testCases; i++)

{

String input = scanner.next();

if(input.matches("[_\\.]\\d+[a-zA-Z]*_?"))

{

System.out.println("VALID");

}

else

{

System.out.println("INVALID");

}

scanner.close();

}

JavaScript

function processData(input) {
    var lines = input.split("\n");
    for(var i = 1; i < lines.length; i++) {
        if(lines[i].match(/^[_\.]\d+[a-z]*_?$/ig)) {
            console.log("VALID");
        } else {
            console.log("INVALID");
        }
    }
}

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
    _input += input;
});

process.stdin.on("end", function () {
    processData(_input);
});

function processData(input) {

var lines = input.split("\n");

for(var i = 1; i < lines.length; i++) {

if(lines[i].match(/^[_\.]\d+[a-z]*_?$/ig)) {

console.log("VALID");

} else {

console.log("INVALID");

}

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

process.stdin.on("data", function (input) {

_input += input;

});

process.stdin.on("end", function () {

processData(_input);

});

Scala

import scala.io.Source

object AlienUsername extends App {
  val usernames = Source.stdin.getLines().drop(1)

  println(usernames.map(validateUsername).mkString("\n"))

  def validateUsername(name: String): String = {
    if (name.matches("[_\\.]\\d+[a-zA-Z]*_?"))
      return "VALID"
    else
      return "INVALID"
  }
}

import scala.io.Source

object AlienUsername extends App {

val usernames = Source.stdin.getLines().drop(1)

println(usernames.map(validateUsername).mkString("\n"))

def validateUsername(name: String): String = {

if (name.matches("[_\\.]\\d+[a-zA-Z]*_?"))

return "VALID"

else

return "INVALID"

}

Ruby

n = gets.to_i
n.times do
  name = gets.to_s.strip
  if /[_\.]\d+[a-zA-Z]*_?/ =~ name
    puts "VALID"
  else
    puts "INVALID"
  end
end

n = gets.to_i

n.times do

name = gets.to_s.strip

if /[_\.]\d+[a-zA-Z]*_?/ =~ name

puts "VALID"

else

puts "INVALID"

end

Hackerrank – Chocolate Feast

Problem Statement A description of the problem can be found on Hackerrank. Solution Calculate count of chocolates: chocolates = money / price . Count of chocolates is count of wrappers, too. Free chocolates are calculated: divide chocolates with count of chocolates needed for discount add solution of the division to chocolates new wrappers count is: […]

Hackerrank – Cavity Map

Problem Statement A description of the problem can be found on Hackerrank. Solution Filter all matrix indexes that are at the periphery. For all the rest choose one index and compare its value with all neighbours (left, right, up, down). If it is greater than all neighbours, replace it with ‘X’. I created solution in […]

Hackerrank – Service Lane

Problem Statement A description of the problem can be found on Hackerrank. Solution Find minimum in given array from index i to j. I created solution in 4 languages: Scala Java JavaScript Ruby All solutions are also available on my GitHub. Scala

object ServiceLane extends App {
  val lines = io.Source.stdin.getLines().toList
  val lanes = lines(1).split(" ").map(_.toInt)
  val segments = lines.drop(2)
  val vehicles = segments.map(width(lanes, _))
  println(vehicles.mkString("\n"))

  def width(lanes: Array[Int], inputLane: String): Int = {
    val arr = inputLane.split(" ").map(_.toInt)
    lanes.slice(arr(0), arr(1) + 1).min
  }
}

object ServiceLane extends App {

val lines = io.Source.stdin.getLines().toList

val lanes = lines(1).split(" ").map(_.toInt)

val segments = lines.drop(2)

val vehicles = segments.map(width(lanes, _))

println(vehicles.mkString("\n"))

def width(lanes: Array[Int], inputLane: String): Int = {

val arr = inputLane.split(" ").map(_.toInt)

lanes.slice(arr(0), arr(1) + 1).min

}

Java

import java.util.Scanner;

public class ServiceLane
{
    private static final int BIKE = 1;
    private static final int TRUCK = 3;

    public static void main(String[] args)
    {
         Scanner scanner = new Scanner(System.in);
         int laneLength = scanner.nextInt();
         int testCases = scanner.nextInt();
         int[] laneWidth = new int[laneLength];
         for (int i = 0; i < laneLength; i++)
         {
             laneWidth[i] = scanner.nextInt();
         }
         for (int j = 0; j < testCases; j++)
         {
             int laneEntry = scanner.nextInt();
             int laneExit = scanner.nextInt();
             System.out.println(largestVehicle(laneWidth, laneEntry, laneExit));
         }
         scanner.close();
    }

    private static int largestVehicle(int[] laneWidth, int laneEntry, int laneExit)
    {
         int car = TRUCK;
         while (car > BIKE && laneExit >= laneEntry)
         {
             if(laneWidth[laneEntry] < car)
             {
                 car = laneWidth[laneEntry];
             }
             laneEntry++;
         }
         return car;
    }
}

import java.util.Scanner;

public class ServiceLane

{

private static final int BIKE = 1;

private static final int TRUCK = 3;

public static void main(String[] args)

{

Scanner scanner = new Scanner(System.in);

int laneLength = scanner.nextInt();

int testCases = scanner.nextInt();

int[] laneWidth = new int[laneLength];

for (int i = 0; i < laneLength; i++)

{

laneWidth[i] = scanner.nextInt();

}

for (int j = 0; j < testCases; j++)

{

int laneEntry = scanner.nextInt();

int laneExit = scanner.nextInt();

System.out.println(largestVehicle(laneWidth, laneEntry, laneExit));

}

scanner.close();

}

private static int largestVehicle(int[] laneWidth, int laneEntry, int laneExit)

{

int car = TRUCK;

while (car > BIKE && laneExit >= laneEntry)

{

if(laneWidth[laneEntry] < car)

{

car = laneWidth[laneEntry];

}

laneEntry++;

}

return car;

}

JavaScript

function processData(input) {
    var lines = input.split('\n');
    var lanes = lines[1].split(' ').map(function(item) {return parseInt(item)});
    for(var i = 2; i < lines.length; i++) {
        var arr = lines[i].split(' ').map(function(item) {return parseInt(item)});
        console.log(findMin(lanes, arr[0], arr[1]));
    }
}

function findMin(arr, i, j) {
    var min = 10000000;
    for(var k = i; k <= j; k++) {
        if(arr[k] < min) {
            min = arr[k];
        }
    }
    return min;
}

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
    _input += input;
});

process.stdin.on("end", function () {
    processData(_input);
});

function processData(input) {

var lines = input.split('\n');

var lanes = lines[1].split(' ').map(function(item) {return parseInt(item)});

for(var i = 2; i < lines.length; i++) {

var arr = lines[i].split(' ').map(function(item) {return parseInt(item)});

console.log(findMin(lanes, arr[0], arr[1]));

}

function findMin(arr, i, j) {

var min = 10000000;

for(var k = i; k <= j; k++) {

if(arr[k] < min) {

min = arr[k];

}

return min;

}

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

process.stdin.on("data", function (input) {

_input += input;

});

process.stdin.on("end", function () {

processData(_input);

});

Ruby

(length, tests) = gets.split(" ").map{ |i| i.to_i }
lanes = gets.split(" ").map{ |i| i.to_i }

tests.times do
  arr = gets.split(" ").map{ |i| i.to_i }
  puts lanes.slice(arr[0], arr[1] - arr[0] + 1).min
end

(length, tests) = gets.split(" ").map{ |i| i.to_i }

lanes = gets.split(" ").map{ |i| i.to_i }

tests.times do

arr = gets.split(" ").map{ |i| i.to_i }

puts lanes.slice(arr[0], arr[1] - arr[0] + 1).min

end

Pavol Pidanič

I can count to 1023 with 10 fingers

Tag: scala

Hackerrank – Connecting Towns

Hackerrank – Computing the GCD

Hackerrank – Closest Numbers

Hackerrank – B’day Gift

Hackerrank – Anagram

Hackerrank – Alternating Characters

Hackerrank – Alien Username

Hackerrank – Chocolate Feast

Hackerrank – Cavity Map

Hackerrank – Service Lane