Archives hackerrank - Stránka 18 z 25

Hackerrank – Select by ID

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vyber všetky riady a aplikuj filtrovanie ak stĺpec ID sa rovná 1661. Vytvoril som riešenie v týchto programovacích jazykoch: SQL Všetky riešenia sú dostupné aj na mojom GitHub profile. SQL

select * from City where ID = 1661;

1	select * from City where ID = 1661;

Hackerrank – Weather Observation Station 1

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vyber City, State a potom ich usporiadaj podľa city vzostupne a state tiež vzostupne. Vytvoril som riešenie v týchto programovacích jazykoch: SQL Všetky riešenia sú dostupné aj na mojom GitHub profile. SQL

select city, state from station order by city asc, state asc;

1	select city, state from station order by city asc, state asc;

Hackerrank – Weather Observation Station 3

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

select distinct city 
  from station 
where 
  MOD(id, 2) = 0
order by city asc;

select distinct city

from station

where

MOD(id, 2) = 0

order by city asc;

Hackerrank – Weather Observation Station 4

select num - num_uniq
from (
    select count(city) as num, count(distinct city) as num_uniq 
    from station
);

select num - num_uniq

from (

select count(city) as num, count(distinct city) as num_uniq

from station

);

Hackerrank – Handshake

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie $$handshakes = \sum_{i=0}^{directors-1}{i}$$ Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Ruby Scala Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.*;

public class Handshake {

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

import java.util.*;

public class Handshake {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

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

long handshakes = 0;

int directors = stdin.nextInt();

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

handshakes += j;

}

System.out.println(handshakes);

}

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let directors = input.split('\n').map(i => parseInt(i))
    for(let i = 1; i < directors.length; i++) {
        let handshakes = 0;
        for(let j = 0; j < directors[i]; j++) {
            handshakes += j;
        }
        console.log(handshakes);
    }
};

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 directors = input.split('\n').map(i => parseInt(i))

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

let handshakes = 0;

for(let j = 0; j < directors[i]; j++) {

handshakes += j;

}

console.log(handshakes);

}

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Ruby

gets.chomp.to_i.times do
  directors = gets.chomp.to_i
  result = 0
  (directors - 1).downto 0 do |handshakes|
    result += handshakes
  end
  puts result
end

gets.chomp.to_i.times do

directors = gets.chomp.to_i

result = 0

(directors - 1).downto 0 do |handshakes|

result += handshakes

end

puts result

end

Scala

import scala.io.Source

object Handshake extends App {
  val lines = Source.stdin.getLines()
  val directors = lines.drop(1).map(_.toInt)
  val handshakes = directors.map(Range(0, _).toList.sum)
  println(handshakes.mkString("\n"))
}

import scala.io.Source

object Handshake extends App {

val lines = Source.stdin.getLines()

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

val handshakes = directors.map(Range(0, _).toList.sum)

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

}

Hackerrank – Halloween Party

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Kúsky čokolády vypočítame: $$horizontal = slices / 2$$ $$vertical = slices – horizontal$$ $$pieces = horizontal * vertical$$ 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 HalloweenParty {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = stdin.nextInt();
        for(int i = 0; i < tests; i++) {
            long k = stdin.nextLong();
            long horizontal = k / 2;
            long vertical = k - horizontal;
            System.out.println(vertical * horizontal);
        }
        stdin.close();
    }
}

import java.util.*;

public class HalloweenParty {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

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

long k = stdin.nextLong();

long horizontal = k / 2;

long vertical = k - horizontal;

System.out.println(vertical * horizontal);

}

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let lines = input.split("\n");
    let slices = lines.map(i => parseInt(i));
    const pieces = k => {
        let horizontal = parseInt(k / 2);
        let vertical = k - horizontal;
        return vertical * horizontal;
    };
    for(let i = 1; i < slices.length; i++) {
        console.log(pieces(slices[i]));
    }
};

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 slices = lines.map(i => parseInt(i));

const pieces = k => {

let horizontal = parseInt(k / 2);

let vertical = k - horizontal;

return vertical * horizontal;

};

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

console.log(pieces(slices[i]));

}

};

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 HalloweenParty extends App {
  val lines = Source.stdin.getLines()
  val slices = lines.drop(1).map(_.toLong)
  val result = slices.map(pieces)
  println(result.mkString("\n"))

  def pieces(k: Long): Long = {
    val horizontal = k / 2
    val vertical = k - horizontal
    vertical * horizontal
  }
}

import scala.io.Source

object HalloweenParty extends App {

val lines = Source.stdin.getLines()

val slices = lines.drop(1).map(_.toLong)

val result = slices.map(pieces)

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

def pieces(k: Long): Long = {

val horizontal = k / 2

val vertical = k - horizontal

vertical * horizontal

}

Ruby […]

Hackerrank – HackerRank Tweets

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Skontrolovať, či každý riadok je validný pre nasledovný regulárny výraz. .*hackerrank.* 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 HackerrankTweets {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = Integer.parseInt(stdin.nextLine());
        int count = 0;
        for(int i = 0; i < tests; i++) {
            if(stdin.nextLine().toLowerCase().matches(".*hackerrank.*")) {
                count++;
            }
        }
        System.out.println(count);
        stdin.close();
    }
}

import java.util.*;

public class HackerrankTweets {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

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

int count = 0;

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

if(stdin.nextLine().toLowerCase().matches(".*hackerrank.*")) {

count++;

}

System.out.println(count);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let lines = input.split('\n').slice(1);
    let matches = lines.filter(line => line.toLowerCase().match(/.*hackerrank.*/));
    console.log(matches.length);
};

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').slice(1);

let matches = lines.filter(line => line.toLowerCase().match(/.*hackerrank.*/));

console.log(matches.length);

};

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 HackerrankTweets extends App {
  val lines = Source.stdin.getLines().drop(1)
  val matchingLines = lines.count(_.toLowerCase.matches(".*hackerrank.*"))
  println(matchingLines)
}

import scala.io.Source

object HackerrankTweets extends App {

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

val matchingLines = lines.count(_.toLowerCase.matches(".*hackerrank.*"))

println(matchingLines)

}

Ruby

tests = gets.chomp.to_i
result = 0
tests.times do
  words = gets.chomp.split
  words.each do |word|
    result += 1 if word.downcase =~ /.*hackerrank.*/
  end
end

puts result

tests = gets.chomp.to_i

result = 0

tests.times do

words = gets.chomp.split

words.each do |word|

result += 1 if word.downcase =~ /.*hackerrank.*/

end

puts result

Hackerrank – Gemstones

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Urobiť prienik znakov vo vstupných reťazcoch (Iba výskyty rovnakých znakoch vo všetkých reťazcoch). Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Ruby Scala Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

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

public class GemStones
{
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int rocks = scanner.nextInt();

        char[] first = scanner.next().toCharArray();

        Set<Character> result = new HashSet<>();
        for (char c : first)
        {
            result.add(c);
        }

        for (int i = 1; i < rocks; i++)
        {
            char[] composition = scanner.next().toCharArray();
            Set<Character> set = new HashSet<>();
            for (char d : result)
            {
                for (int j = 0; j < composition.length; j++)
                {
                    if(d == composition[j])
                    {
                        set.add(composition[j]);
                    }
                }
            }
            result = set;
        }
        System.out.println(result.size());
        scanner.close();
    }
}

import java.util.HashSet;

import java.util.Scanner;

import java.util.Set;

public class GemStones

{

public static void main(String[] args)

{

Scanner scanner = new Scanner(System.in);

int rocks = scanner.nextInt();

char[] first = scanner.next().toCharArray();

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

for (char c : first)

{

result.add(c);

}

for (int i = 1; i < rocks; i++)

{

char[] composition = scanner.next().toCharArray();

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

for (char d : result)

{

for (int j = 0; j < composition.length; j++)

{

if(d == composition[j])

{

set.add(composition[j]);

}

result = set;

}

System.out.println(result.size());

scanner.close();

}

JavaScript

function processData(input) {
    var lines = input.split('\n');
    var first = lines[1].split('');
    for(var i = 2; i < lines.length; i++) {
        first = intersect(first, lines[i].split(''));
    }
    console.log(first.length)
}

function intersect(arr1, arr2) {
    var unique1 = arr1.distinct();
    var unique2 = arr2.distinct();
    return unique1.distinct().filter(function(s) {
        return unique2.distinct().indexOf(s) !== -1
    });
}

Array.prototype.distinct = function() {
    var hash = {};
    var a = [];
    for(var i = 0; i < this.length; i++) {
        if(hash.hasOwnProperty(this[i])) {
            continue;
        }
        hash[this[i]] = true;
        a.push(this[i]);
    }
    return a;
};

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 first = lines[1].split('');

for(var i = 2; i < lines.length; i++) {

first = intersect(first, lines[i].split(''));

}

console.log(first.length)

}

function intersect(arr1, arr2) {

var unique1 = arr1.distinct();

var unique2 = arr2.distinct();

return unique1.distinct().filter(function(s) {

return unique2.distinct().indexOf(s) !== -1

});

}

Array.prototype.distinct = function() {

var hash = {};

var a = [];

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

if(hash.hasOwnProperty(this[i])) {

continue;

}

hash[this[i]] = true;

a.push(this[i]);

}

return a;

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

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

_input += input;

});

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

processData(_input);

});

Ruby

string_count = gets.to_i
first = gets.chars.uniq
(string_count - 1).times do
  s = gets.chars.uniq
  first = first & s
end
puts first.length

string_count = gets.to_i

first = gets.chars.uniq

(string_count - 1).times do

s = gets.chars.uniq

first = first & s

end

puts first.length

Scala

import scala.io.Source

object Gemstones extends App {
  val strings = Source.stdin.getLines().drop(1).toList

  val first = strings(0)
  val gemstones = strings.drop(1).foldLeft(first)(_ intersect _)
  println(gemstones.size)
}

import scala.io.Source

object Gemstones extends App {

val strings = Source.stdin.getLines().drop(1).toList

val first = strings(0)

val gemstones = strings.drop(1).foldLeft(first)(_ intersect _)

println(gemstones.size)

}

Hackerrank – Game of Thrones – I

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Podmienky pre zistenie palindrómu: ak je dĺžka reťazca párna, potom sa musí každý znak vyskytovať v reťazci párny počet krát ak je dĺžka reťazca nepárne číslo, potom musí byť výskyt iba jedného znaku nepárny počet krát, ostatné sa musia vyskytovať párny počet krát Vytvoril som […]

Hackerrank – Funny String

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Pre každý index i v reťazci s skontroluj, či je výsledok tejto rovnice vždy rovnaký. $$|s_{i} – s_{i+1}| – |s_{length(s)-i-2} – s_{length(s)-i-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.Scanner;

public class FunnyString 
{

    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 s = stdin.nextLine();
            if(isFunny(s))
            {
                System.out.println("Funny");
            }
            else
            {
                System.out.println("Not Funny");
            }
            
        }
        stdin.close();
    }
    
    private static boolean isFunny(String s)
    {
        for(int j = 0; j < s.length() - 1; j++)
        {
            if(Math.abs(Character.codePointAt(s, j + 1) - Character.codePointAt(s, j)) !=
                    Math.abs(Character.codePointAt(s, s.length() - j - 2) - Character.codePointAt(s, s.length() - j - 1)))
            {
                return false;
            }
        }
        return true;
    }
}

import java.util.Scanner;

public class FunnyString

{

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

if(isFunny(s))

{

System.out.println("Funny");

}

else

{

System.out.println("Not Funny");

}

stdin.close();

}

private static boolean isFunny(String s)

{

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

{

if(Math.abs(Character.codePointAt(s, j + 1) - Character.codePointAt(s, j)) !=

Math.abs(Character.codePointAt(s, s.length() - j - 2) - Character.codePointAt(s, s.length() - j - 1)))

{

return false;

}

return true;

}

JavaScript […]

Pavol Pidanič

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

Značka: hackerrank

Hackerrank – Select by ID

Hackerrank – Weather Observation Station 1

Hackerrank – Weather Observation Station 3

Hackerrank – Weather Observation Station 4

Hackerrank – Handshake

Hackerrank – Halloween Party

Hackerrank – HackerRank Tweets

Hackerrank – Gemstones

Hackerrank – Game of Thrones – I

Hackerrank – Funny String