Archives java - Page 8 of 14

Hackerrank – Caesar Cipher

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 […]

Hackerrank – Java If-Else

Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Java All solutions are also available on my GitHub. Java

import java.util.*;

public class JavaIfElse {
   public static void main(String[] args) {
       Scanner sc = new Scanner(System.in);
       int n = sc.nextInt();            
       String ans = "";
       if(n % 2 == 1) {
           ans = "Weird";
       }
       else {
           if(n >= 2 && n <= 5) {
               ans = "Not Weird";
           } else if(n >= 6 && n <= 20) {
               ans = "Weird";
           } else {
               ans = "Not Weird";
           }
       }
       System.out.println(ans);
   }
}

import java.util.*;

public class JavaIfElse {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

int n = sc.nextInt();

String ans = "";

if(n % 2 == 1) {

ans = "Weird";

}

else {

if(n >= 2 && n <= 5) {

ans = "Not Weird";

} else if(n >= 6 && n <= 20) {

ans = "Weird";

} else {

ans = "Not Weird";

}

System.out.println(ans);

}

Hackerrank – Arrays- DS

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

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();
    }
}

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

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

'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

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

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

n = gets.strip.to_i
arr = gets.strip
arr = arr.split(' ').map(&:to_i)
puts arr.reverse.join(" ")

n = gets.strip.to_i

arr = gets.strip

arr = arr.split(' ').map(&:to_i)

puts arr.reverse.join(" ")

Hackerrank – Welcome To Java!

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

}

Hackerrank – Valid PAN Format

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

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

Problem Statement A description of the problem can be found on Hackerrank. Solution Make a height and initialize its value as 1. For each input number: if it is even double the height if it odd add 1 to height. I created solution in: Java JavaScript Scala Ruby All solutions are also available on my […]

Hackerrank – Two Arrays

Problem Statement A description of the problem can be found on Hackerrank. Solution Sort two arrays. array1 ascending, array2 descending. Add each ith element in both array and compare if their sum is greater or equals than required amount. I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. […]

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

Pavol Pidanič

I can count to 1023 with 10 fingers

Tag: java

Hackerrank – Caesar Cipher

Hackerrank – Java If-Else

Hackerrank – Arrays- DS

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