Archives hackerrank - Stránka 14 z 25

Hackerrank – Welcome To Java!

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvoril som riešenie v týchto programovacích jazykoch: Java Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

public class WelcomeToJava
{
    public static void main(String []argv)
    {
        System.out.println("Hello World.");
        System.out.println("Hello Java.");
    }
}

public class WelcomeToJava

{

public static void main(String []argv)

{

System.out.println("Hello World.");

System.out.println("Hello Java.");

}

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Regulárny výraz: [A-Z]{5}\d{4}[A-Z] Vytvoril som riešenie v týchto programovacích jazykoch: Ruby Java JavaScript Scala Všetky riešenia sú dostupné aj na mojom GitHub profile. Ruby

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

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

Java

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";
        }
    }
}

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

'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));

'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

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"
    }
  }
}

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"

}

Hackerrank – Utopian Tree

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvoril som premennú height a inicializoval hodnotu na 1. Pre každé zadané číslo: ak je párne, vynásob height dvomi; ak je nepárne, tak pripočítaj 1 ku height. Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Scala Ruby Všetky riešenia sú dostupné aj na mojom […]

Hackerrank – Two Arrays

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Usporiadl som obidve zadané polia. array1 vzostupne, array2 zostupne. Spočítaj prvky na každej i-tej pozícii, či je ich súčet menší ako zadaný súčet. Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Scala Ruby Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.*;

public class TwoArrays {

    private static class Descending implements Comparator<Integer> {
        @Override
        public int compare(Integer i, Integer j) {
            return j - i;
        }
    }

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = stdin.nextInt();
        for(int i = 0; i < tests; i++) {
            int n = stdin.nextInt();
            int sum = stdin.nextInt();
            Integer[] array1 = new Integer[n];
            Integer[] array2 = new Integer[n];
            for(int j = 0; j < n; j++){
                array1[j] = stdin.nextInt();
            }
            for(int j = 0; j < n; j++){
                array2[j] = stdin.nextInt();
            }
            Arrays.sort(array1);
            Arrays.sort(array2, new Descending());
            System.out.println(isCorrect(array1, array2, sum));
        }
        stdin.close();
    }

    private static String isCorrect(Integer[] array1, Integer[] array2, int sum) {
        for(int i = 0; i < array1.length; i++) {
            if(array1[i] + array2[i] < sum) {
                return "NO";
            }
        }
        return "YES";
    }
}

import java.util.*;

public class TwoArrays {

private static class Descending implements Comparator<Integer> {

@Override

public int compare(Integer i, Integer j) {

return j - i;

}

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

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

int n = stdin.nextInt();

int sum = stdin.nextInt();

Integer[] array1 = new Integer[n];

Integer[] array2 = new Integer[n];

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

array1[j] = stdin.nextInt();

}

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

array2[j] = stdin.nextInt();

}

Arrays.sort(array1);

Arrays.sort(array2, new Descending());

System.out.println(isCorrect(array1, array2, sum));

}

stdin.close();

}

private static String isCorrect(Integer[] array1, Integer[] array2, int sum) {

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

if(array1[i] + array2[i] < sum) {

return "NO";

}

return "YES";

}

[…]

Hackerrank – The Love-Letter Mystery

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Spočítal som sumu rozdielov ASCII kódu znaku na pozícii length(s)-i-1 a ASCII kódu znaku na pozícii i. Vytvoril som riešenie v týchto programovacích jazykoch: Java Ruby JavaScript Scala Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.Scanner;

public class LoveLetterMystery {
    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = stdin.nextInt();
        for(int i = 0; i < tests; i++) {
            String s = stdin.next();
            int diff = 0;
            for(int j = 0; j < s.length() / 2; j++) {
                diff += Math.abs(Character.codePointAt(s, j) - Character.codePointAt(s, s.length() - j - 1));
            }
            System.out.println(diff);
        }
        stdin.close();
    }
}

import java.util.Scanner;

public class LoveLetterMystery {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

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

String s = stdin.next();

int diff = 0;

for(int j = 0; j < s.length() / 2; j++) {

diff += Math.abs(Character.codePointAt(s, j) - Character.codePointAt(s, s.length() - j - 1));

}

System.out.println(diff);

}

stdin.close();

}

Ruby

tests = gets.chomp.to_i
tests.times do
  input = gets.chomp
  changes = 0
  for i in 0...input.length / 2
    char_front = input[i]
    char_back = input[input.length - 1 - i]
    diff = (char_front.ord - char_back.ord).abs
    changes += diff
  end
  puts changes
end

tests = gets.chomp.to_i

tests.times do

input = gets.chomp

changes = 0

for i in 0...input.length / 2

char_front = input[i]

char_back = input[input.length - 1 - i]

diff = (char_front.ord - char_back.ord).abs

changes += diff

end

puts changes

end

JavaScript

function processData(input) {
    var lines = input.split('\n');
    for(var i = 1; i < lines.length; i++) {
        var diff = 0;
        for(var j = 0; j < lines[i].length / 2; j++) {
            diff += Math.abs(lines[i].charCodeAt(j) - lines[i].charCodeAt(lines[i].length - j - 1));
        }
        console.log(diff);
    }
}

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

var diff = 0;

for(var j = 0; j < lines[i].length / 2; j++) {

diff += Math.abs(lines[i].charCodeAt(j) - lines[i].charCodeAt(lines[i].length - j - 1));

}

console.log(diff);

}

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 TheLoveLetterMystery extends App {
  val lines = Source.stdin.getLines().drop(1)
  val diffs = lines.map(changes)
  println(diffs.mkString("\n"))

  def changes(s: String): Int = {
    val halves = s.splitAt(s.length / 2)
    val reverted2 = halves._2.reverse
    halves._1.indices.map(i => ordinalDiff(halves._1.charAt(i), reverted2.charAt(i))).sum
  }

  def ordinalDiff(ch1: Char, ch2: Char): Int = {
    (ch2 - ch1).abs
  }
}

import scala.io.Source

object TheLoveLetterMystery extends App {

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

val diffs = lines.map(changes)

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

def changes(s: String): Int = {

val halves = s.splitAt(s.length / 2)

val reverted2 = halves._2.reverse

halves._1.indices.map(i => ordinalDiff(halves._1.charAt(i), reverted2.charAt(i))).sum

}

def ordinalDiff(ch1: Char, ch2: Char): Int = {

(ch2 - ch1).abs

}

Hackerrank – The British and American Style of Spelling

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Skontroloval som pre každé slovo vo vete, či obsahuje &guot;ze" pre americkú angličtinu alebo &guot;se" pre britskú angličtinu. Vytvoril som riešenie v týchto programovacích jazykoch: Scala Ruby JavaScript Java Všetky riešenia sú dostupné aj na mojom GitHub profile. Scala

import scala.io.Source

object AmericanEnglishSpelling extends App {
  val lines = Source.stdin.getLines().toList
  val n = lines(0).toInt
  val words = lines.slice(1, n + 1).map(_.split(" ")).flatten
  val tests = lines(n + 1).toInt
  val testWords = lines.drop(n + 2)
  val counts = testWords.map(w => words.count(isUsOrUkSpelling(_, w)))
  println(counts.mkString("\n"))

  def isUsOrUkSpelling(word: String, matching: String): Boolean = {
    word.matches(matching) || word.matches(matching.replaceAll("ze", "se"))
  }
}

import scala.io.Source

object AmericanEnglishSpelling extends App {

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

val n = lines(0).toInt

val words = lines.slice(1, n + 1).map(_.split(" ")).flatten

val tests = lines(n + 1).toInt

val testWords = lines.drop(n + 2)

val counts = testWords.map(w => words.count(isUsOrUkSpelling(_, w)))

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

def isUsOrUkSpelling(word: String, matching: String): Boolean = {

word.matches(matching) || word.matches(matching.replaceAll("ze", "se"))

}

Ruby

lines = gets.chomp.to_i
all_words = []
lines.times do
  words = gets.chomp.split.map { |s| s.to_s }
  words.each { |w| all_words << w}
end

tests = gets.chomp.to_i
tests.times do
  us_word = gets.chomp.to_s
  uk_word = us_word.sub("ze", "se")
  count = 0
  all_words.each do |word|
    count += 1 if word == us_word || word == uk_word
  end
  puts count
end

lines = gets.chomp.to_i

all_words = []

lines.times do

words = gets.chomp.split.map { |s| s.to_s }

words.each { |w| all_words << w}

end

tests = gets.chomp.to_i

tests.times do

us_word = gets.chomp.to_s

uk_word = us_word.sub("ze", "se")

count = 0

all_words.each do |word|

count += 1 if word == us_word || word == uk_word

end

puts count

end

JavaScript

function processData(input) {
    var lines = input.split("\n");
    var n = parseInt(lines[0]);
    var words = [];
    for(var i = 1; i <= n; i++) {
        var arr = lines.split(" ");
        for(var j = 0; j < arr.length; j++) {
            words.push(arr[j]);
        }
    }
    var tests = parseInt(lines[n + 1]);
    for(var t = n + 1; t <= n + tests; t++) {
        var count = 0;
        var american = lines[t];
        var british = lines[t].replace(/ze/g, "se");
        for(var w = 0; w < words.length; w++) {
            if(w.match(american) || w.match(british)) {
                count++;
            }
        }
        console.log(count);
    }
}

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 words = [];

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

var arr = lines.split(" ");

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

words.push(arr[j]);

}

var tests = parseInt(lines[n + 1]);

for(var t = n + 1; t <= n + tests; t++) {

var count = 0;

var american = lines[t];

var british = lines[t].replace(/ze/g, "se");

for(var w = 0; w < words.length; w++) {

if(w.match(american) || w.match(british)) {

count++;

}

console.log(count);

}

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

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

_input += input;

});

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

processData(_input);

});

Java […]

Hackerrank – Split the Phone Numbers

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Regulárny výraz potrebný na rozdelenie telefónneho čísla: \s|\- Vytvoril som riešenie v týchto programovacích jazykoch: Scala Java JavaScript Ruby Všetky riešenia sú dostupné aj na mojom GitHub profile. Scala

import scala.io.Source

object SplitPhoneNumber extends App {

  private[this] val SPLIT_PATTERN = " |\\-"

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

  numbers.foreach(num => {
    val splits = num.split(SPLIT_PATTERN)
    println(s"CountryCode=${splits(0)},LocalAreaCode=${splits(1)},Number=${splits(2)}")
  })
}

import scala.io.Source

object SplitPhoneNumber extends App {

private[this] val SPLIT_PATTERN = " |\\-"

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

numbers.foreach(num => {

val splits = num.split(SPLIT_PATTERN)

println(s"CountryCode=${splits(0)},LocalAreaCode=${splits(1)},Number=${splits(2)}")

})

}

Java

import java.util.*;

public class SplitPhoneNumbers {

    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++) {
            String[] splits = stdin.nextLine().split(" |\\-");
            System.out.println("CountryCode=" + splits[0]
                    + ",LocalAreaCode=" + splits[1] + ",Number=" + splits[2]);
        }
        stdin.close();
    }
}

import java.util.*;

public class SplitPhoneNumbers {

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

String[] splits = stdin.nextLine().split(" |\\-");

System.out.println("CountryCode=" + splits[0]

+ ",LocalAreaCode=" + splits[1] + ",Number=" + splits[2]);

}

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let numbers = input.split('\n').slice(1);
    for(let i = 0; i < numbers.length; i++) {
        let splits = numbers[i].split(/ |\-/);
        console.log("CountryCode=" + splits[0]
            + ",LocalAreaCode=" + splits[1] + ",Number=" + splits[2]);
    }
};

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 numbers = input.split('\n').slice(1);

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

let splits = numbers[i].split(/ |\-/);

console.log("CountryCode=" + splits[0]

+ ",LocalAreaCode=" + splits[1] + ",Number=" + splits[2]);

}

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Ruby

tests = gets.chomp.to_i
tests.times do
  (country_code, local_area, number) = gets.chomp.split(/ |\-/)
  puts "CountryCode=#{country_code},LocalAreaCode=#{local_area},Number=#{number}"
end

tests = gets.chomp.to_i

tests.times do

(country_code, local_area, number) = gets.chomp.split(/ |\-/)

puts "CountryCode=#{country_code},LocalAreaCode=#{local_area},Number=#{number}"

end

Hackerrank – Snakes and Ladders: The Quickest Way Up

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvoril som riešenie v týchto programovacích jazykoch: Ruby Všetky riešenia sú dostupné aj na mojom GitHub profile. Ruby

class Move
  attr_reader :rolls, :position
  
  def initialize(position, rolls)
    @position = position
    @rolls = rolls
  end
end

test_cases = gets.chomp.to_i
test_cases.times do
  (ladders_count, snakes_count) = gets.chomp.split(",").map { |e| e.to_i }
  ladders = gets.chomp.split
  snakes = gets.chomp.split
  ladders_hash = Hash.new
  snakes_hash = Hash.new
  ladders.each do |ladder|
    (start_p, end_p) = ladder.split(",").map { |e| e.to_i }
    ladders_hash[start_p] = end_p
  end
  
  snakes.each do |snake|
    (start_p, end_p) = snake.split(",").map { |e| e.to_i }
    snakes_hash[start_p] = end_p
  end
  
  start = Move.new(1, 0)
  moves = []
  moves.push(start)
  rolls_at_hundred = []
  while !moves.empty? do
    move = moves.shift
    actual_position = move.position
    actual_rolls = move.rolls
    
    if actual_position >= 100
      rolls_at_hundred << actual_rolls
      next 
    end
    
    for i in 1..5
      pos = ladders_hash[actual_position + i]
      if !pos.nil?
        new_move = Move.new(pos, actual_rolls + 1)
        moves.push(new_move)
      end
    end
    
    pos = ladders_hash[actual_position + 6]
    if pos.nil?
      without_ladder = Move.new(actual_position + 6, actual_rolls + 1)
      moves.push(without_ladder)
    else
      new_move = Move.new(pos, actual_rolls + 1)
      moves.push(new_move)
    end
  end

  rolls_at_hundred.sort! { |k, l| k <=> l}
  puts rolls_at_hundred[0]
end

class Move

attr_reader :rolls, :position

def initialize(position, rolls)

@position = position

@rolls = rolls

end

test_cases = gets.chomp.to_i

test_cases.times do

(ladders_count, snakes_count) = gets.chomp.split(",").map { |e| e.to_i }

ladders = gets.chomp.split

snakes = gets.chomp.split

ladders_hash = Hash.new

snakes_hash = Hash.new

ladders.each do |ladder|

(start_p, end_p) = ladder.split(",").map { |e| e.to_i }

ladders_hash[start_p] = end_p

end

snakes.each do |snake|

(start_p, end_p) = snake.split(",").map { |e| e.to_i }

snakes_hash[start_p] = end_p

end

start = Move.new(1, 0)

moves = []

moves.push(start)

rolls_at_hundred = []

while !moves.empty? do

move = moves.shift

actual_position = move.position

actual_rolls = move.rolls

if actual_position >= 100

rolls_at_hundred << actual_rolls

end

for i in 1..5

pos = ladders_hash[actual_position + i]

if !pos.nil?

new_move = Move.new(pos, actual_rolls + 1)

moves.push(new_move)

end

pos = ladders_hash[actual_position + 6]

if pos.nil?

without_ladder = Move.new(actual_position + 6, actual_rolls + 1)

moves.push(without_ladder)

else

new_move = Move.new(pos, actual_rolls + 1)

moves.push(new_move)

end

rolls_at_hundred.sort! { |k, l| k <=> l}

puts rolls_at_hundred[0]

end

Hackerrank – Sherlock and The Beast

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvoril som si 2 premenné: jedna vyjadruje počet_pätiek a druhá vyjadruje počet_trojok. Na začiatku si obe premenné inicializujeme počet_pätiek hodnotou dĺžky zadaného čísla a počet_trojok hodnotou 0. Zistíme či je počet_pätiek deliteľný 3 a počet_trojok deliteľný 5. Ak neplatia podmieky, potom odčítame 5 z počet_pätiek […]

Hackerrank – Rotate String

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvoril som riešenie v týchto programovacích jazykoch: Scala Všetky riešenia sú dostupné aj na mojom GitHub profile. Scala

object RotateString extends App {

   val lines = io.Source.stdin.getLines().toList
   val n = lines.head.toInt
   val strings = lines.tail

   strings.foreach(s =>
     println(rotations(s, 0).mkString(" "))
   )

   def rotate(s: String): String = {
     s.tail + s.head
   }

   def rotations(s: String, n: Int): List[String] = {
     if(n == s.length) Nil else rotate(s) :: rotations(rotate(s), n + 1)
   }
 }

object RotateString extends App {

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

val n = lines.head.toInt

val strings = lines.tail

strings.foreach(s =>

println(rotations(s, 0).mkString(" "))

)

def rotate(s: String): String = {

s.tail + s.head

}

def rotations(s: String, n: Int): List[String] = {

if(n == s.length) Nil else rotate(s) :: rotations(rotate(s), n + 1)

}

Pavol Pidanič

Dokážem na 10 prstoch napočítať do 1023

Značka: hackerrank

Hackerrank – Welcome To Java!

Hackerrank – Valid PAN Format

Hackerrank – Utopian Tree

Hackerrank – Two Arrays

Hackerrank – The Love-Letter Mystery

Hackerrank – The British and American Style of Spelling

Hackerrank – Split the Phone Numbers

Hackerrank – Snakes and Ladders: The Quickest Way Up

Hackerrank – Sherlock and The Beast

Hackerrank – Rotate String