January 2016 - Page 3 of 8

Hackerrank – Java Stdin and Stdout 1

Problem Statement A description of the problem can be found on Hackerrank. Solution Repeat reading int from scanner as in example for 2 another variables Again print 2 new variables to standard output as example with variable a. I created solution in: Java All solutions are also available on my GitHub. Java

import java.util.*;

public class Solution
{
    public static void main(String[] args)
    {
        Scanner sc=new Scanner(System.in);
        int a=sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        System.out.println(a);
        System.out.println(b);
        System.out.println(c);
    }
}

import java.util.*;

public class Solution

{

public static void main(String[] args)

{

Scanner sc=new Scanner(System.in);

int a=sc.nextInt();

int b = sc.nextInt();

int c = sc.nextInt();

System.out.println(a);

System.out.println(b);

System.out.println(c);

}

Hackerrank – Is Fibo

Problem Statement A description of the problem can be found on Hackerrank. Solution Create Fibonacci sequence and check if the actual Fibonacci number is equals number n. Stop the sequence if actual Fibonacci number is greater then n. I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. Java […]

Hackerrank – IP Address Validation

Problem Statement A description of the problem can be found on Hackerrank. Solution IP4 regex: \b(((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\b IP6 regex: ([a-f0-9]{1,4}:){7}\b[0-9a-f]{1,4}\b I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. Java

import java.util.*;

public class IPAddressValidation {

    private static final String IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";
    private static final String IP4_PATTERN =
            "\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

    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(ipValidation(stdin.nextLine()));
        }
        stdin.close();
    }

    private static String ipValidation(String address) {
        if(address.matches(IP6_PATTERN))
            return "IPv6";
        else if(address.matches(IP4_PATTERN))
            return "IPv4";
        else
            return "Neither";
    }
}

import java.util.*;

public class IPAddressValidation {

private static final String IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";

private static final String IP4_PATTERN =

"\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

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(ipValidation(stdin.nextLine()));

}

stdin.close();

}

private static String ipValidation(String address) {

if(address.matches(IP6_PATTERN))

return "IPv6";

else if(address.matches(IP4_PATTERN))

return "IPv4";

else

return "Neither";

}

JavaScript

'use strict';

const IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";
const IP4_PATTERN =
    "\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

const processData = input => {
    let lines = input.split('\n').slice(1);
    let ipValidation = address => {
        if(address.match(new RegExp(IP4_PATTERN))) {
            return "IPv4";
        } else if(address.match(new RegExp(IP6_PATTERN))) {
            return "IPv6";
        } else {
            return "Neither";
        }
    };
    let validations = lines.map(ipValidation);
    console.log(validations.join('\n'));
};

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

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

'use strict';

const IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";

const IP4_PATTERN =

"\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

const processData = input => {

let lines = input.split('\n').slice(1);

let ipValidation = address => {

if(address.match(new RegExp(IP4_PATTERN))) {

return "IPv4";

} else if(address.match(new RegExp(IP6_PATTERN))) {

return "IPv6";

} else {

return "Neither";

}

};

let validations = lines.map(ipValidation);

console.log(validations.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

import scala.io.Source

object IPAddressValidation extends App {
  private[this] val IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b"
  private[this] val IP4_PATTERN =
    "\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b"

  val lines = Source.stdin.getLines().drop(1)
  val validation = lines.map(ipValidation)
  println(validation.mkString("\n"))

  def ipValidation(address: String): String = {
    if(address.matches(IP6_PATTERN))
      "IPv6"
    else if(address.matches(IP4_PATTERN))
      "IPv4"
    else
      "Neither"
  }
}

import scala.io.Source

object IPAddressValidation extends App {

private[this] val IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b"

private[this] val IP4_PATTERN =

"\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b"

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

val validation = lines.map(ipValidation)

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

def ipValidation(address: String): String = {

if(address.matches(IP6_PATTERN))

"IPv6"

else if(address.matches(IP4_PATTERN))

"IPv4"

else

"Neither"

}

Ruby

tests = gets.chomp.to_i
tests.times do
  input = gets.chomp.to_s
  if input =~ /\b(((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\b/
    puts "IPv4" 
  elsif input =~ /([a-f0-9]{1,4}:){7}\b[0-9a-f]{1,4}\b/
    puts "IPv6"
  else
    puts "Neither"
  end
end

tests = gets.chomp.to_i

tests.times do

input = gets.chomp.to_s

if input =~ /\b(((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\b/

puts "IPv4"

elsif input =~ /([a-f0-9]{1,4}:){7}\b[0-9a-f]{1,4}\b/

puts "IPv6"

else

puts "Neither"

end

Hackerrank – Intro to Tutorial Challenges

Problem Statement A description of the problem can be found on Hackerrank. Solution Check all array elements if one of them is equal to required value. Then print its index to the output. I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. Java

import java.util.Scanner;

public class IntroToTutorialChallenges
{
    public static void main(String[] args)
    {
        Scanner stdin = new Scanner(System.in);
        int v = Integer.parseInt(stdin.nextLine());
        int size = Integer.parseInt(stdin.nextLine());
        String[] numbers = stdin.nextLine().split(" ");
        System.out.println(getPosition(numbers, v));
        
        stdin.close();
    }
    
    private static int getPosition(String[] numbers, int v)
    {
        for(int i = 0; i < numbers.length; i++)
        {
            if(v == Integer.parseInt(numbers[i]))
            {
                return i;
            }
        }
        return 0;
    }
}

import java.util.Scanner;

public class IntroToTutorialChallenges

{

public static void main(String[] args)

{

Scanner stdin = new Scanner(System.in);

int v = Integer.parseInt(stdin.nextLine());

int size = Integer.parseInt(stdin.nextLine());

String[] numbers = stdin.nextLine().split(" ");

System.out.println(getPosition(numbers, v));

stdin.close();

}

private static int getPosition(String[] numbers, int v)

{

for(int i = 0; i < numbers.length; i++)

{

if(v == Integer.parseInt(numbers[i]))

{

return i;

}

return 0;

}

JavaScript

'use strict';

const processData = input => {
    let getPosition = (arr, val) => {
        for(let i = 0; i < arr.length; i++) {
            if(arr[i] == val) {
                return i;
            }
        }
    };
    let lines = input.split('\n');
    let searchedValue = parseInt(lines[0]);
    let array = lines[2].split(' ').map(i => parseInt(i));
    let position = getPosition(array, searchedValue);
    console.log(position);
};

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

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

'use strict';

const processData = input => {

let getPosition = (arr, val) => {

for(let i = 0; i < arr.length; i++) {

if(arr[i] == val) {

return i;

}

};

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

let searchedValue = parseInt(lines[0]);

let array = lines[2].split(' ').map(i => parseInt(i));

let position = getPosition(array, searchedValue);

console.log(position);

};

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 IntroToTutorialChallenges extends App {
  val lines = Source.stdin.getLines().toList
  val searchedValue = lines(0).toInt
  val array = lines(2).split(" ").map(_.toInt)

  val valPosition = getPosition(array, searchedValue)
  println(valPosition)

  def getPosition(array: Array[Int], value: Int): Int = {
    array.indexOf(value)
  }
}

import scala.io.Source

object IntroToTutorialChallenges extends App {

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

val searchedValue = lines(0).toInt

val array = lines(2).split(" ").map(_.toInt)

val valPosition = getPosition(array, searchedValue)

println(valPosition)

def getPosition(array: Array[Int], value: Int): Int = {

array.indexOf(value)

}

[…]

Hackerrank – Insertion Sort – Part 1

Problem Statement A description of the problem can be found on Hackerrank. Solution Assign to auxiliary variable the last element of the array. Iterate from last element to 0th. If an actual element is lower than auxiliary, assign auxiliary to actual index, else switch actual element with last actual. I created solution in: Java JavaScript […]

Hackerrank – Ice Cream Parlor

Problem Statement A description of the problem can be found on Hackerrank. Solution For each ith price, check if ith price plus (i+1)th price is equal required amount. I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. Java

import java.util.*;

public class IceCreamParlor {

    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++) {
            int amount = Integer.parseInt(stdin.nextLine());
            int length = Integer.parseInt(stdin.nextLine());
            int[] costs = new int[length];
            String[] strings = stdin.nextLine().split(" ");
            for(int j = 0; j < length; j++) {
                costs[j] = Integer.parseInt(strings[j]);
            }
            for(int j = 0; j < length - 1; j++) {
                for(int k = j + 1; k < length; k++) {
                    if(costs[j] + costs[k] == amount) {
                        System.out.println((j + 1) + " " + (k + 1));
                    }
                }
            }
        }
        stdin.close();
    }
}

import java.util.*;

public class IceCreamParlor {

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++) {

int amount = Integer.parseInt(stdin.nextLine());

int length = Integer.parseInt(stdin.nextLine());

int[] costs = new int[length];

String[] strings = stdin.nextLine().split(" ");

for(int j = 0; j < length; j++) {

costs[j] = Integer.parseInt(strings[j]);

}

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

for(int k = j + 1; k < length; k++) {

if(costs[j] + costs[k] == amount) {

System.out.println((j + 1) + " " + (k + 1));

}

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let lines = input.split('\n');
    let tests = parseInt(lines[0]);
    let index = 1;
    for(let i = 0; i < tests; i++) {
        let amount = parseInt(lines[index++]);
        let lenght = parseInt(lines[index++]);
        let costs = lines[index++].split(" ").map(i => parseInt(i));
        let indexes = [];
        for(let j = 0; j < lenght - 1; j++) {
            for(let k = j + 1; k < lenght; k++) {
                if(costs[j] + costs[k] === amount) {
                    indexes.push(j + 1);
                    indexes.push(k + 1);
                }
            }
        }
        console.log(indexes.join(" "));
    }
};

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

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

'use strict';

const processData = input => {

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

let tests = parseInt(lines[0]);

let index = 1;

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

let amount = parseInt(lines[index++]);

let lenght = parseInt(lines[index++]);

let costs = lines[index++].split(" ").map(i => parseInt(i));

let indexes = [];

for(let j = 0; j < lenght - 1; j++) {

for(let k = j + 1; k < lenght; k++) {

if(costs[j] + costs[k] === amount) {

indexes.push(j + 1);

indexes.push(k + 1);

}

console.log(indexes.join(" "));

}

};

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.collection.mutable.ListBuffer
import scala.io.Source

object IceCreamParlor extends App {
  val console = Source.stdin.bufferedReader()
  val tests = console.readLine().toInt
  (0 until tests).foreach(_ => {
    val amount = console.readLine().toInt
    val lenght = console.readLine().toInt
    val costs = console.readLine().split(" ").map(_.toInt)
    println(indexes(costs, amount).mkString(" "))
  })

  def indexes(costs: Array[Int], amount: Int): List[Int] = {
    val result: ListBuffer[Int] = ListBuffer.empty
    (0 until costs.length - 1).foreach(i => {
      (i + 1 until costs.length).foreach(j => {
        if(costs(i) + costs(j) == amount) {
          result += i + 1
          result += j + 1
        }
      })
    })
    result.toList
  }
}

import scala.collection.mutable.ListBuffer

import scala.io.Source

object IceCreamParlor extends App {

val console = Source.stdin.bufferedReader()

val tests = console.readLine().toInt

(0 until tests).foreach(_ => {

val amount = console.readLine().toInt

val lenght = console.readLine().toInt

val costs = console.readLine().split(" ").map(_.toInt)

println(indexes(costs, amount).mkString(" "))

})

def indexes(costs: Array[Int], amount: Int): List[Int] = {

val result: ListBuffer[Int] = ListBuffer.empty

(0 until costs.length - 1).foreach(i => {

(i + 1 until costs.length).foreach(j => {

if(costs(i) + costs(j) == amount) {

result += i + 1

result += j + 1

}

})

result.toList

}

Ruby

tests = gets.chomp.to_i
tests.times do
  m = gets.chomp.to_i
  n = gets.chomp.to_i
  flavors = gets.chomp.split.map { |e| e.to_i }
  for i in 0...flavors.length - 1 do
    for j in i + 1...flavors.length do
      puts "#{i + 1} #{j + 1}" if flavors[i] + flavors[j] == m
    end
  end
end

tests = gets.chomp.to_i

tests.times do

m = gets.chomp.to_i

n = gets.chomp.to_i

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

for i in 0...flavors.length - 1 do

for j in i + 1...flavors.length do

puts "#{i + 1} #{j + 1}" if flavors[i] + flavors[j] == m

end

Hackerrank – Weather Observation Station 5

Problem Statement A description of the problem can be found on Hackerrank. Solution 2 queries: One that selects cities that are ordered by city length ascending and printed first row containing city and its length. Second is almost the same as first but cities are ordered descending. In both queries I used second ordering by […]

Hackerrank – Weather Observation Station 6

Problem Statement A description of the problem can be found on Hackerrank. Solution Check if city starts with one of (‘a’, ‘i’, ‘e’, ‘o’, ‘u’) and orders them alphabetically. I created solution in: SQL All solutions are also available on my GitHub. SQL

select distinct city
from station
where lower(substr(city, 1, 1)) in ('a', 'e', 'i', 'o', 'u')
    order by city asc;

select distinct city

from station

where lower(substr(city, 1, 1)) in ('a', 'e', 'i', 'o', 'u')

order by city asc;

Hackerrank – Weather Observation Station 7

Problem Statement A description of the problem can be found on Hackerrank. Solution Almost the same principle as Weather Observation Station 6, only substring is different. I created solution in: SQL All solutions are also available on my GitHub. SQL

select distinct city
  from station
where 
  substr(lower(city), length(city), 1) in ('a', 'e', 'i', 'o', 'u')
  order by city;

select distinct city

from station

where

substr(lower(city), length(city), 1) in ('a', 'e', 'i', 'o', 'u')

order by city;

Hackerrank – Weather Observation Station 8

Problem Statement A description of the problem can be found on Hackerrank. Solution Joins conditions of Weather Observation Station 6 and Weather Observation Station 7 I created solution in: SQL All solutions are also available on my GitHub. SQL

select distinct city
  from station
where 
  substr(lower(city), 1, 1) in ('a', 'e', 'i', 'o', 'u')
     AND
  substr(lower(city), length(city), 1) in ('a', 'e', 'i', 'o', 'u')
  order by city;

select distinct city

from station

where

substr(lower(city), 1, 1) in ('a', 'e', 'i', 'o', 'u')

AND

substr(lower(city), length(city), 1) in ('a', 'e', 'i', 'o', 'u')

order by city;

Pavol Pidanič

I can count to 1023 with 10 fingers

Month: January 2016

Hackerrank – Java Stdin and Stdout 1

Hackerrank – Is Fibo

Hackerrank – IP Address Validation

Hackerrank – Intro to Tutorial Challenges

Hackerrank – Insertion Sort – Part 1

Hackerrank – Ice Cream Parlor

Hackerrank – Weather Observation Station 5

Hackerrank – Weather Observation Station 6

Hackerrank – Weather Observation Station 7

Hackerrank – Weather Observation Station 8