Archives ruby - Page 5 of 10

Hackerrank – The Love-Letter Mystery

Problem Statement A description of the problem can be found on Hackerrank. Solution For an element at index i create sum of differences between an ordinal number of character at index length(s)-i-1 and an ordinal number of the character at index i. I created solution in: Java Ruby JavaScript Scala All solutions are also available […]

Hackerrank – The British and American Style of Spelling

Problem Statement A description of the problem can be found on Hackerrank. Solution For each word in each sentence check if the word contains “ze” (US) or “se” (UK). I created solution in: Scala Ruby JavaScript Java All solutions are also available on my GitHub. 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

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class BritishAndAmericanSpelling {
    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int n = Integer.parseInt(stdin.nextLine());
        List<String> words = new ArrayList<>();
        for(int i = 0; i < n; i++) {
            String[] s = stdin.nextLine().split(" ");
            words.addAll(Arrays.asList(s));
        }
        int tests = Integer.parseInt(stdin.nextLine());
        for(int i = 0; i < tests; i++) {
            int count = 0;
            String american = stdin.nextLine();
            String british = american.replaceAll("ze", "se");
            for(int j = 0; j < words.size(); j++) {
                if(words.get(j).matches(american) || words.get(j).matches(british)) {
                    count++;
                }
            }
            System.out.println(count);
        }

        stdin.close();
    }
}

import java.util.ArrayList;

import java.util.Arrays;

import java.util.List;

import java.util.Scanner;

public class BritishAndAmericanSpelling {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

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

List<String> words = new ArrayList<>();

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

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

words.addAll(Arrays.asList(s));

}

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

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

int count = 0;

String american = stdin.nextLine();

String british = american.replaceAll("ze", "se");

for(int j = 0; j < words.size(); j++) {

if(words.get(j).matches(american) || words.get(j).matches(british)) {

count++;

}

System.out.println(count);

}

stdin.close();

}

Hackerrank – Split the Phone Numbers

Problem Statement A description of the problem can be found on Hackerrank. Solution Splitting pattern: \s|\- I created solution in: Scala Java JavaScript Ruby All solutions are also available on my GitHub. 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

Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Ruby All solutions are also available on my GitHub. 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

Problem Statement A description of the problem can be found on Hackerrank. Solution Create two number: one of them represents fives_count and the second threes_count. Initialize fives_count as length of the number and threes_count as 0. Check if fives_count is divisible by 3 and threes_count is divisible by 5. Then substract 5 from fives_count and […]

Hackerrank – Picking Cards

Problem Statement A description of the problem can be found on Hackerrank. Solution Sort the array descending. Take N from the input. For each element e substract N – e. That means that there is only N – e combinations to choose these two cards. After substraction decrement N and select the next element. All […]

Hackerrank – Pangrams

Problem Statement A description of the problem can be found on Hackerrank. Solution Calculate if an input contains 26 distinct characters. I created solution in: Java JavaScript Ruby Scala All solutions are also available on my GitHub. Java

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class Pangrams 
{
    public static void main(String[] args)
    {
        Scanner stdin = new Scanner(System.in);
        String string = stdin.nextLine().toLowerCase();
        Set<Character> alphabet = new HashSet<>();
        for(int i = 0; i < string.length(); i++)
        {
            if(string.charAt(i) != ' ')
            {
                alphabet.add(string.charAt(i));
            }
        }
        
        if(alphabet.size() == 26)
        {
            System.out.println("pangram");
        }
        else 
        {
            System.out.println("not pangram");
        }
        stdin.close();
    }
}

import java.util.HashSet;

import java.util.Scanner;

import java.util.Set;

public class Pangrams

{

public static void main(String[] args)

{

Scanner stdin = new Scanner(System.in);

String string = stdin.nextLine().toLowerCase();

Set<Character> alphabet = new HashSet<>();

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

{

if(string.charAt(i) != ' ')

{

alphabet.add(string.charAt(i));

}

if(alphabet.size() == 26)

{

System.out.println("pangram");

}

else

{

System.out.println("not pangram");

}

stdin.close();

}

JavaScript

function processData(input) {
    var hash = {};
    input = input.toLowerCase().replace(/\s+/g, '');
    for(var i = 0; i < input.length; i++) {
        hash[input[i]] = true;
    }

    if(isPangram(hash)) {
        console.log("pangram");
    } else {
        console.log("not pangram");
    }
}

function isPangram(hash) {
    var chars = 0;
    for(prop in hash) {
        if(hash.hasOwnProperty(prop)) {
            chars++;
        }
    }
    return chars === 26;
}

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 hash = {};

input = input.toLowerCase().replace(/\s+/g, '');

for(var i = 0; i < input.length; i++) {

hash[input[i]] = true;

}

if(isPangram(hash)) {

console.log("pangram");

} else {

console.log("not pangram");

}

function isPangram(hash) {

var chars = 0;

for(prop in hash) {

if(hash.hasOwnProperty(prop)) {

chars++;

}

return chars === 26;

}

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

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

_input += input;

});

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

processData(_input);

});

Ruby

require 'set'

s = Set.new(gets.downcase.gsub(/\s+/, "").chars())
if(s.size() == 26)
  puts "pangram"
else
  puts "not pangram"
end

require 'set'

s = Set.new(gets.downcase.gsub(/\s+/, "").chars())

if(s.size() == 26)

puts "pangram"

else

puts "not pangram"

end

Scala

import scala.io.Source

object Pangrams extends App {
  println(
    if(Source.stdin.bufferedReader().readLine().toLowerCase().distinct.replaceAll("\\s+", "").distinct.length == 26)
      "pangram"
    else
      "not pangram"
  )
}

import scala.io.Source

object Pangrams extends App {

println(

if(Source.stdin.bufferedReader().readLine().toLowerCase().distinct.replaceAll("\\s+", "").distinct.length == 26)

"pangram"

else

"not pangram"

)

}

Hackerrank – Pairs

Problem Statement A description of the problem can be found on Hackerrank. Solution Sort the array. Choose one element and check continously every next element after chosen element if their difference is equals to k. If it is greater stop comparisons and choose next element. Note: JavaScript and Ruby solutions use the same algorithm as […]

Hackerrank – Missing Numbers

Problem Statement A description of the problem can be found on Hackerrank. Solution Calculate count of every number in array A and B. Check every number count from B if it is in the array A or its count is lower than the count of the number in the array A. I created solution in: […]

Hackerrank – Minimum Draws

Problem Statement A description of the problem can be found on Hackerrank. Solution Minimum result if always greater then a given count of pairs. I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. Java

import java.util.*;

public class MinimumDraws {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = stdin.nextInt();
        for(int i = 0; i < tests; i++) {
            System.out.println(stdin.nextInt() + 1);
        }
        stdin.close();
    }
}

import java.util.*;

public class MinimumDraws {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

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

System.out.println(stdin.nextInt() + 1);

}

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    console.log(input.split('\n').slice(1).map(i => parseInt(i) + 1).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 processData = input => {

console.log(input.split('\n').slice(1).map(i => parseInt(i) + 1).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 MinimumDraws extends App {
  val lines = Source.stdin.getLines()
  val pairs = lines.drop(1).map(_.toInt)
  val draws = pairs.map(_ + 1)
  println(draws.mkString("\n"))
}

import scala.io.Source

object MinimumDraws extends App {

val lines = Source.stdin.getLines()

val pairs = lines.drop(1).map(_.toInt)

val draws = pairs.map(_ + 1)

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

}

Ruby

tests = gets.chomp.to_i
tests.times do
    pairs = gets.chomp.to_i
    result = pairs + 1
    puts result
end

tests = gets.chomp.to_i

tests.times do

pairs = gets.chomp.to_i

result = pairs + 1

puts result

end

Pavol Pidanič

I can count to 1023 with 10 fingers

Tag: ruby

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 – Picking Cards

Hackerrank – Pangrams

Hackerrank – Pairs

Hackerrank – Missing Numbers

Hackerrank – Minimum Draws