Archives scala - Stránka 9 z 15

Hackerrank – Missing Numbers

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Urči počty výskytov čísel v oboch poliach A a B. Zisti, či sa nachádza každé číslo z B v A a aj jeho výskyt menší. Vtedy je chýbajúce. Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Scala Ruby Všetky riešenia sú dostupné aj na […]

Hackerrank – Minimum Draws

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Urobíme si všetky dvojice pozícii ale len také, ktorých hodnoty sú rovnaké. Najdeme najväčší rozdiel medzi pozíciami. 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. Java

import java.util.*;

public class MinimumDistances {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int n = stdin.nextInt();
        int[] array = new int[n];
        for(int i = 0; i < n; i++) {
            array[i] = stdin.nextInt();
        }

        int min = Integer.MAX_VALUE;
        for(int i = 0; i < n - 1; i++) {
            for(int j = i + 1; j < n; j++) {
                if(array[i] == array[j]) {
                    min = Math.min(min, Math.abs(j - i));
                }
            }
        }
        int result = (min == Integer.MAX_VALUE ? -1 : min);
        System.out.println(result);
        stdin.close();
    }
}

import java.util.*;

public class MinimumDistances {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int n = stdin.nextInt();

int[] array = new int[n];

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

array[i] = stdin.nextInt();

}

int min = Integer.MAX_VALUE;

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

for(int j = i + 1; j < n; j++) {

if(array[i] == array[j]) {

min = Math.min(min, Math.abs(j - i));

}

int result = (min == Integer.MAX_VALUE ? -1 : min);

System.out.println(result);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    const lines = input.split('\n');
    const array = lines[1].split(' ').map(i => parseInt(i));

    let min = 999999999;
    for(let i = 0; i < array.length - 1; i++) {
        for(let j = i + 1; j < array.length; j++) {
            if(array[i] == array[j]) {
                min = Math.min(min, Math.abs(j - i));
            }
        }
    }
    const result = (min === 999999999 ? -1 : min);
    console.log(result);
};

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

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

'use strict';

const processData = input => {

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

const array = lines[1].split(' ').map(i => parseInt(i));

let min = 999999999;

for(let i = 0; i < array.length - 1; i++) {

for(let j = i + 1; j < array.length; j++) {

if(array[i] == array[j]) {

min = Math.min(min, Math.abs(j - i));

}

const result = (min === 999999999 ? -1 : min);

console.log(result);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

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

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

Scala

object MinimumDistances extends App {
  val lines = Source.stdin.getLines().toList
  val array = lines(1).split(" ").map(_.toInt)

  val indexPairs = array.indices.flatMap(i => array.indices.slice(i + 1, array.length).map(j => (i, j)))
  val equalValues = indexPairs.filter(pair => array(pair._1) == array(pair._2))
  val distances = equalValues.map(pair => (pair._1 - pair._2).abs)

  val result = if(distances.isEmpty) -1 else distances.min
  println(result)
}

object MinimumDistances extends App {

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

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

val indexPairs = array.indices.flatMap(i => array.indices.slice(i + 1, array.length).map(j => (i, j)))

val equalValues = indexPairs.filter(pair => array(pair._1) == array(pair._2))

val distances = equalValues.map(pair => (pair._1 - pair._2).abs)

val result = if(distances.isEmpty) -1 else distances.min

println(result)

}

[…]

Hackerrank – Maximizing XOR

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvor dvojice pre všetky čísla v intervale [l, r]. Urob medzi nimi operáciu XOR a vyber maximum. 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 MaximizingXor {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int l = stdin.nextInt();
        int r = stdin.nextInt();
        int max = 0;
        for(int i = l; i <= r; i++) {
            for(int j = l; j <= r; j++) {
                int xor = i ^ j;
                if(xor > max) {
                    max = xor;
                }
            }
        }
        System.out.println(max);
        stdin.close();
    }
}

import java.util.*;

public class MaximizingXor {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int l = stdin.nextInt();

int r = stdin.nextInt();

int max = 0;

for(int i = l; i <= r; i++) {

for(int j = l; j <= r; j++) {

int xor = i ^ j;

if(xor > max) {

max = xor;

}

System.out.println(max);

stdin.close();

}

JavaScript

function processData(input) {
    var l = parseInt(input.split("\n")[0]);
    var r = parseInt(input.split("\n")[1]);
    var max = 0;
    for(var i = l; i <= r; i++) {
        for(var j = l; j <= r; j++) {
            var xor = i ^ j;
            if(xor > max) {
                max = xor;
            }
        }
    }
    console.log(max);
}

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 l = parseInt(input.split("\n")[0]);

var r = parseInt(input.split("\n")[1]);

var max = 0;

for(var i = l; i <= r; i++) {

for(var j = l; j <= r; j++) {

var xor = i ^ j;

if(xor > max) {

max = xor;

}

console.log(max);

}

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 MaximizingXor extends App {
  val lines = Source.stdin.getLines().toList
  val l = lines(0).toInt
  val r = lines(1).toInt
  val maxXor = (l: Int, r: Int) => {
    var max = 0
    (l to r).foreach(
      i => {
        (l to r).foreach(
          j => {
            val xor = i ^ j
            if (xor > max) max = xor
          })
      }
    )
    max
  }

  println(maxXor(l, r))
}

import scala.io.Source

object MaximizingXor extends App {

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

val l = lines(0).toInt

val r = lines(1).toInt

val maxXor = (l: Int, r: Int) => {

var max = 0

(l to r).foreach(

i => {

(l to r).foreach(

j => {

val xor = i ^ j

if (xor > max) max = xor

})

}

)

max

}

println(maxXor(l, r))

}

Ruby

def maxXor(l, r)
  max = 0
  for i in l..r do
    for j in l..r do
      xor = i ^ j
      max = xor if xor > max
    end
  end
  return max
end


l = gets.to_i
r = gets.to_i
print maxXor(l, r)

def maxXor(l, r)

max = 0

for i in l..r do

for j in l..r do

xor = i ^ j

max = xor if xor > max

end

return max

end

l = gets.to_i

r = gets.to_i

print maxXor(l, r)

Hackerrank – Max Min

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Usporiadaj zadané prvky vzostupne. Vytvor k častí poľa. Vypočítaj unfairness ako rozdiel medzi prvým a posledným prvkom pre všetky vytvorené časti. Nájdi minimum zpomedzi všetkých unfairness. Problém je známy aj pod menom Angry Children. Vytvoril som riešenie v týchto programovacích jazykoch: Ruby Java JavaScript Scala […]

Hackerrank – Manasa and Stones

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Výsledok sú všetky listy stromu s výškou n, ktorý vznikne určením jeho koreňa veľkosti 0 a každý potomok uzla vypočítame parent + a and parent + b. Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Scala Ruby Všetky riešenia sú dostupné aj na mojom […]

Hackerrank – Lonely Integer

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Nájdi počty všetkých elementov s rovnakou hodnotou a vypíš iba tie, ktorých je počet rovný 1. 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 LonelyInteger {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int n = stdin.nextInt();
        Map<Integer, Integer> array = new HashMap<>();
        for(int i = 0; i < n; i++) {
            int num = stdin.nextInt();
            Integer count = array.get(num);
            if(count == null) {
                array.put(num, 1);
            } else {
                array.put(num, count + 1);
            }
        }
        for(Integer key : array.keySet()) {
            if(array.get(key) == 1) {
                System.out.println(key);
                break;
            }
        }

        stdin.close();
    }
}

import java.util.*;

public class LonelyInteger {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int n = stdin.nextInt();

Map<Integer, Integer> array = new HashMap<>();

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

int num = stdin.nextInt();

Integer count = array.get(num);

if(count == null) {

array.put(num, 1);

} else {

array.put(num, count + 1);

}

for(Integer key : array.keySet()) {

if(array.get(key) == 1) {

System.out.println(key);

break;

}

stdin.close();

}

JavaScript

function processData(input) {
    var arr = input.split("\n")[1].split(" ").map(function(item) {return parseInt(item)});
    var hash = {};
    for(var i = 0; i < arr.length; i++) {
        if(hash[arr[i]]) {
            hash[arr[i]] += 1;
        } else {
            hash[arr[i]] = 1;
        }
    }
    for(prop in hash) {
        if(hash.hasOwnProperty(prop) && hash[prop] == 1) {
            console.log(prop);
            return;
        }
    }
}

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 arr = input.split("\n")[1].split(" ").map(function(item) {return parseInt(item)});

var hash = {};

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

if(hash[arr[i]]) {

hash[arr[i]] += 1;

} else {

hash[arr[i]] = 1;

}

for(prop in hash) {

if(hash.hasOwnProperty(prop) && hash[prop] == 1) {

console.log(prop);

return;

}

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 LonelyInteger extends App {
  val arr = (Source.stdin.getLines().toList)(1).split(" ").map(_.toInt)
  val groups = arr.groupBy(i => i)
  val uniqueElement = groups.keys.find(key => groups.get(key).get.size == 1)
  println(uniqueElement)
}

import scala.io.Source

object LonelyInteger extends App {

val arr = (Source.stdin.getLines().toList)(1).split(" ").map(_.toInt)

val groups = arr.groupBy(i => i)

val uniqueElement = groups.keys.find(key => groups.get(key).get.size == 1)

println(uniqueElement)

}

Ruby

length = gets.chomp.to_i
array = gets.chomp.split.map { |e| e.to_i }
hash = Hash.new
array.each do |i|
  if hash[i].nil?
    hash[i] = 1
  else
    hash[i] += 1
  end
end

array.each { |a| puts a if hash[a] == 1}

length = gets.chomp.to_i

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

hash = Hash.new

array.each do |i|

if hash[i].nil?

hash[i] = 1

else

hash[i] += 1

end

array.each { |a| puts a if hash[a] == 1}

Hackerrank – Is Fibo

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvoríme si Fibonacciho postupnosť a zistíme, či sa fibonaciho číslo rovná požadovanému n. 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.math.BigInteger;
import java.util.*;

public class IsFibo {

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

    private static String isFibo(BigInteger n) {
        BigInteger fib0 = BigInteger.ZERO;
        BigInteger fib1 = BigInteger.ONE;
        while(fib0.compareTo(n) <= 0) {
            if (fib0.compareTo(n) == 0) return "IsFibo";
            BigInteger temp = fib0;
            fib0 = fib1;
            fib1 = fib1.add(temp);
        }
        return "IsNotFibo";
    }
}

import java.math.BigInteger;

import java.util.*;

public class IsFibo {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

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

BigInteger n = stdin.nextBigInteger();

System.out.println(isFibo(n));

}

stdin.close();

}

private static String isFibo(BigInteger n) {

BigInteger fib0 = BigInteger.ZERO;

BigInteger fib1 = BigInteger.ONE;

while(fib0.compareTo(n) <= 0) {

if (fib0.compareTo(n) == 0) return "IsFibo";

BigInteger temp = fib0;

fib0 = fib1;

fib1 = fib1.add(temp);

}

return "IsNotFibo";

}

JavaScript

'use strict';

let isFibo = n => {
    let fib0 = 0;
    let fib1 = 1;
    while(fib0 <= n) {
        if (fib0 == n) return "IsFibo";
        let temp = fib0;
        fib0 = fib1;
        fib1 += temp;
    }
    return "IsNotFibo"
};
const processData = input => {
    console.log(input.split("\n").slice(1).map(i => parseInt(i)).map(isFibo).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';

let isFibo = n => {

let fib0 = 0;

let fib1 = 1;

while(fib0 <= n) {

if (fib0 == n) return "IsFibo";

let temp = fib0;

fib0 = fib1;

fib1 += temp;

}

return "IsNotFibo"

};

const processData = input => {

console.log(input.split("\n").slice(1).map(i => parseInt(i)).map(isFibo).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 IsFibo extends App {
  val lines = Source.stdin.getLines()
  val numbers = lines.drop(1).map(BigInt(_))
  val fibos = numbers.map(isFibo)
  println(fibos.mkString("\n"))

  def isFibo(n: BigInt): String = {
    var fib0: BigInt = 0
    var fib1: BigInt = 1
    while(fib0 <= n) {
      if (fib0 == n) return "IsFibo"
      val temp: BigInt = fib0
      fib0 = fib1
      fib1 += temp
    }
    "IsNotFibo"
  }
}

import scala.io.Source

object IsFibo extends App {

val lines = Source.stdin.getLines()

val numbers = lines.drop(1).map(BigInt(_))

val fibos = numbers.map(isFibo)

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

def isFibo(n: BigInt): String = {

var fib0: BigInt = 0

var fib1: BigInt = 1

while(fib0 <= n) {

if (fib0 == n) return "IsFibo"

val temp: BigInt = fib0

fib0 = fib1

fib1 += temp

}

"IsNotFibo"

}

Ruby

def is_fibo(number)
  fib0 = 0
  fib1 = 1
  while fib0 <= number do
    return "IsFibo" if fib0 == number
    temp = fib0
    fib0 = fib1
    fib1 += temp
  end
  return "IsNotFibo"  
end

test_cases = gets.chomp.to_i
test_cases.times do
  number = gets.chomp.to_i
  result = is_fibo(number)
  puts result
end

def is_fibo(number)

fib0 = 0

fib1 = 1

while fib0 <= number do

return "IsFibo" if fib0 == number

temp = fib0

fib0 = fib1

fib1 += temp

end

return "IsNotFibo"

end

test_cases = gets.chomp.to_i

test_cases.times do

number = gets.chomp.to_i

result = is_fibo(number)

puts result

end

Hackerrank – IP Address Validation

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie 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 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 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

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Zisti, či existujú prvky poľa, ktoré sa rovnajú zadanej hodnote. 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.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)

}

Ruby

def get_position(arr, val)
  (arr.size - 1).times do |i|
    return i if(val == arr[i])
  end
end

searched_value = gets.to_s.chomp.to_i
array_length = gets.to_s.chomp.to_i
arr = gets.to_s.split.map{ |i| i.to_i }

position = get_position(arr, searched_value)
puts position

def get_position(arr, val)

(arr.size - 1).times do |i|

return i if(val == arr[i])

end

searched_value = gets.to_s.chomp.to_i

array_length = gets.to_s.chomp.to_i

arr = gets.to_s.split.map{ |i| i.to_i }

position = get_position(arr, searched_value)

puts position

Hackerrank – Insertion Sort – Part 1

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Priraď posledný element do nejakej dočasnej premennej. Iteruj od posledného prvku k prvému (index 0). Ak je aktuálny elemen väčší ako dočasná premenná, priraď do dočasnej premennej index aktuálneho prvku. Inak vymeň aktuálny element s predchádzajúcim. Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript […]

Pavol Pidanič

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

Značka: scala

Hackerrank – Missing Numbers

Hackerrank – Minimum Draws

Hackerrank – Maximizing XOR

Hackerrank – Max Min

Hackerrank – Manasa and Stones

Hackerrank – Lonely Integer

Hackerrank – Is Fibo

Hackerrank – IP Address Validation

Hackerrank – Intro to Tutorial Challenges

Hackerrank – Insertion Sort – Part 1