Pavol Pidanič

Hackerrank – Birthday Chocolate

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

import scala.io.Source

object Solution extends App {
    val lines = Source.stdin.getLines().toList
    val bars = lines(1).split(" ").map(_.toInt).toList
    val dm = lines(2).split(" ").map(_.toInt).toList match {
        case i :: j :: Nil => (i, j)
    }

    val allConsecutives = bars.sliding(dm._2)
    val result = allConsecutives.count(bars => bars.sum == dm._1)

    println(result)
}

import scala.io.Source

object Solution extends App {

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

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

val dm = lines(2).split(" ").map(_.toInt).toList match {

case i :: j :: Nil => (i, j)

}

val allConsecutives = bars.sliding(dm._2)

val result = allConsecutives.count(bars => bars.sum == dm._1)

println(result)

}

Java

import java.util.*;

public class Solution {

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

        int result = 0;
        for(int i = 0; i < bars.length - m + 1; i++) {
            int sum = 0;
            for(int j = i; j < i + m; j++) {
                sum += bars[j];
            }
            if(sum == d) {
                result++;
            }
        }

        System.out.println(result);
        stdin.close();
    }
}

import java.util.*;

public class Solution {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

int[] bars = new int[tests];

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

bars[i] = stdin.nextInt();

}

int d = stdin.nextInt();

int m = stdin.nextInt();

int result = 0;

for(int i = 0; i < bars.length - m + 1; i++) {

int sum = 0;

for(int j = i; j < i + m; j++) {

sum += bars[j];

}

if(sum == d) {

result++;

}

System.out.println(result);

stdin.close();

}

Javascript

'use strict';

const processData = input => {
    const lines = input.split('\n');
    const bars = lines[1].split(' ').map(i => parseInt(i));
    const [d, m] = lines[2].split(' ').map(i => parseInt(i));

    let result = 0;
    for(let i = 0; i < bars.length - m + 1; i++) {
        let sum = 0;
        for(let j = i; j < i + m; j++) {
            sum += bars[j];
        }
        if(sum == d) {
            result++;
        }
    }
    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 bars = lines[1].split(' ').map(i => parseInt(i));

const [d, m] = lines[2].split(' ').map(i => parseInt(i));

let result = 0;

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

let sum = 0;

for(let j = i; j < i + m; j++) {

sum += bars[j];

}

if(sum == d) {

result++;

}

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

Hackerrank – Picking Numbers

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Usporiadal som si pole išiel som od 1. prvku (index 0) a posúval som druhý smerník po vyšších indexoch, kým som nenašiel rozdiel väčší ako 1. Vypočítal som počet prvkov medzi indexom i a j. Potom som zvýšil index i a opakoval postup. […]

Hackerrank – Migratory Birds

import scala.io.Source

object Solution extends App {
    val lines = Source.stdin.getLines().toList
    val birds = lines.tail.head.split(" ").map(_.toInt)

    val birdGroups = birds.groupBy(b => b).map(group => (group._1, group._2.length))
    val biggestGroup = birdGroups.foldLeft((0, 0))((maxBirdCountType, group) => {
    val birdType = group._1
    val birdTypeCount = group._2
    if(maxBirdCountType._2 < birdTypeCount) {
        (birdType, birdTypeCount)
    } else {
        maxBirdCountType
    }
    })

    println(biggestGroup._1)
}

import scala.io.Source

object Solution extends App {

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

val birds = lines.tail.head.split(" ").map(_.toInt)

val birdGroups = birds.groupBy(b => b).map(group => (group._1, group._2.length))

val biggestGroup = birdGroups.foldLeft((0, 0))((maxBirdCountType, group) => {

val birdType = group._1

val birdTypeCount = group._2

if(maxBirdCountType._2 < birdTypeCount) {

(birdType, birdTypeCount)

} else {

maxBirdCountType

}

})

println(biggestGroup._1)

}

Java

import java.util.*;

public class MigratoryBirds {

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

        Map<Integer, Integer> birdTypeCount = new HashMap<>();
        for(int i = 0; i < tests; i++) {
            int birdType = birdTypes[i];
            birdTypeCount.put(birdType, birdTypeCount.getOrDefault(birdType, 0) + 1);
        }

        Map.Entry<Integer, Integer> max = null;
        for(Map.Entry<Integer, Integer> birdCount : birdTypeCount.entrySet()) {
            int actualMax;
            if(max == null) {
                actualMax = 0;
            } else {
                actualMax = max.getValue();
            }
            if(birdCount.getValue() > actualMax) {
                max = birdCount;
            }
        }
        System.out.println(max.getKey());
        stdin.close();
    }
}

import java.util.*;

public class MigratoryBirds {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

int[] birdTypes = new int[tests];

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

birdTypes[i] = stdin.nextInt();

}

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

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

int birdType = birdTypes[i];

birdTypeCount.put(birdType, birdTypeCount.getOrDefault(birdType, 0) + 1);

}

Map.Entry<Integer, Integer> max = null;

for(Map.Entry<Integer, Integer> birdCount : birdTypeCount.entrySet()) {

int actualMax;

if(max == null) {

actualMax = 0;

} else {

actualMax = max.getValue();

}

if(birdCount.getValue() > actualMax) {

max = birdCount;

}

System.out.println(max.getKey());

stdin.close();

}

Javascript

'use strict';

const processData = input => {
    const lines = input.split('\n');
    const birds = lines[1].split(' ').map(i => parseInt(i));
    const birdsCounts = [];
    for(let i = 0; i < birds.length; i++) {
        if(birdsCounts[birds[i]]) {
            birdsCounts[birds[i]] = ++birdsCounts[birds[i]];
        } else {
            birdsCounts[birds[i]] = 1
        }
    }

    let maxBirdType = 0;
    let maxBirdTypeCount = 0;
    for(let i = 0; i < birds.length; i++) {
        if(birdsCounts[birds[i]] > maxBirdTypeCount) {
            maxBirdTypeCount = birdsCounts[birds[i]];
            maxBirdType = birds[i]
        }
    }

    console.log(maxBirdType);
};

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 birds = lines[1].split(' ').map(i => parseInt(i));

const birdsCounts = [];

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

if(birdsCounts[birds[i]]) {

birdsCounts[birds[i]] = ++birdsCounts[birds[i]];

} else {

birdsCounts[birds[i]] = 1

}

let maxBirdType = 0;

let maxBirdTypeCount = 0;

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

if(birdsCounts[birds[i]] > maxBirdTypeCount) {

maxBirdTypeCount = birdsCounts[birds[i]];

maxBirdType = birds[i]

}

console.log(maxBirdType);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

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

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

Hackerrank – Mark and Toys

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Najprv si musím usporiadať ceny hračiek v zostupne. Idem od začiatku uporiadaného poľa a spočítavam ceny, ak prekročím max sumu, ktorú mam k dispozícii, vypíšem počet hračiek, ktoré dokážem kúpiť. Vytvoril som riešenie v týchto programovacích jazykoch: Scala Java Javascript Všetky riešenia sú […]

Hackerrank – Electronics Shop

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Urobím to, čo je napísané v zadaní. Hľadám také dvojice klávesnice a usb, ktoré sa najviac približujú požadovanej cene zľava. Vytvoril som riešenie v týchto programovacích jazykoch: Scala Java Javascript Všetky riešenia sú dostupné aj na mojom GitHub profile. Scala

import scala.io.Source

object Solution extends App {
    val lines = Source.stdin.getLines().toList
    val (s, n, m) = lines.head.split(" ").map(_.toInt).toList match {
    case a :: b :: c :: Nil => (a, b, c)
    }
    val keyboards = lines(1).split(" ").map(_.toInt)
    val usbs = lines(2).split(" ").map(_.toInt)

    val allSmallerThanS = (for {
    i <- 0 until n
    j <- 0 until m
    } yield (i, j)).toList.filter {
    a => keyboards(a._1) + usbs(a._2) <= s
    }

    val sum = if(allSmallerThanS.isEmpty) {
    -1
    } else {
    val indexes = allSmallerThanS.maxBy {
        a => keyboards(a._1) + usbs(a._2)
    }
    keyboards(indexes._1) + usbs(indexes._2)
    }
    println(sum)
}

import scala.io.Source

object Solution extends App {

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

val (s, n, m) = lines.head.split(" ").map(_.toInt).toList match {

case a :: b :: c :: Nil => (a, b, c)

}

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

val usbs = lines(2).split(" ").map(_.toInt)

val allSmallerThanS = (for {

i <- 0 until n

j <- 0 until m

} yield (i, j)).toList.filter {

a => keyboards(a._1) + usbs(a._2) <= s

}

val sum = if(allSmallerThanS.isEmpty) {

-1

} else {

val indexes = allSmallerThanS.maxBy {

a => keyboards(a._1) + usbs(a._2)

}

keyboards(indexes._1) + usbs(indexes._2)

}

println(sum)

}

Java

import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int amount = stdin.nextInt();
        int keyboardCount = stdin.nextInt();
        int usbCount = stdin.nextInt();
        int[] keyboards = new int[keyboardCount];
        int[] usbs = new int[usbCount];
        for(int i = 0; i < keyboardCount; i++) {
            keyboards[i] = stdin.nextInt();
        }
        for(int i = 0; i < usbCount; i++) {
            usbs[i] = stdin.nextInt();
        }

        int spentAmount = -1;
        for(int i = 0; i < keyboardCount; i++) {
            for(int j = 0; j < usbCount; j++) {
                int sum = keyboards[i] + usbs[j];
                if(sum <= amount && sum > spentAmount) {
                    spentAmount = sum;
                }
            }
        }
        System.out.println(spentAmount);
        stdin.close();
    }
}

import java.util.*;

public class Solution {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int amount = stdin.nextInt();

int keyboardCount = stdin.nextInt();

int usbCount = stdin.nextInt();

int[] keyboards = new int[keyboardCount];

int[] usbs = new int[usbCount];

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

keyboards[i] = stdin.nextInt();

}

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

usbs[i] = stdin.nextInt();

}

int spentAmount = -1;

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

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

int sum = keyboards[i] + usbs[j];

if(sum <= amount && sum > spentAmount) {

spentAmount = sum;

}

System.out.println(spentAmount);

stdin.close();

}

[…]

Hackerrank – Day of the Programmer

object solution extends App {
    val sc = new java.util.Scanner (System.in)
    
    val year = sc.nextInt
    val output = if (year == 1918)
        "26.09.1918"
    else if (((year <= 1917) && (year%4 == 0)) || ((year%400 == 0) || ((year%4 ==0) & (year%100 != 0))))
        "12.09." + year
    else
        "13.09." + year
    
    println(output)
}

object solution extends App {

val sc = new java.util.Scanner (System.in)

val year = sc.nextInt

val output = if (year == 1918)

"26.09.1918"

else if (((year <= 1917) && (year%4 == 0)) || ((year%400 == 0) || ((year%4 ==0) & (year%100 != 0))))

"12.09." + year

else

"13.09." + year

println(output)

}

Java

import java.util.*;

public class Solution {

    static String solve(int year) {
        if (year == 1918)
            return "26.09.1918";
        else if (((year <= 1917) && (year%4 == 0)) || ((year%400 == 0) || ((year%4 ==0) & (year%100 != 0))))
            return "12.09." + year;
        else
            return "13.09." + year;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int year = in.nextInt();
        String result = solve(year);
        System.out.println(result);
    }
}

import java.util.*;

public class Solution {

static String solve(int year) {

if (year == 1918)

return "26.09.1918";

else if (((year <= 1917) && (year%4 == 0)) || ((year%400 == 0) || ((year%4 ==0) & (year%100 != 0))))

return "12.09." + year;

else

return "13.09." + year;

}

public static void main(String[] args) {

Scanner in = new Scanner(System.in);

int year = in.nextInt();

String result = solve(year);

System.out.println(result);

}

Javascript

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

var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;

process.stdin.on('data', function (data) {
    input_stdin += data;
});

process.stdin.on('end', function () {
    input_stdin_array = input_stdin.split("\n");
    main();    
});

function readLine() {
    return input_stdin_array[input_currentline++];
}

/////////////// ignore above this line ////////////////////

function solve(year){
    if (year == 1918)
        return "26.09.1918";
    else if (((year <= 1917) && (year%4 == 0)) || ((year%400 == 0) || ((year%4 ==0) & (year%100 != 0))))
        return "12.09." + year;
    else
        return "13.09." + year;
}

function main() {
    var year = parseInt(readLine());
    var result = solve(year);
    process.stdout.write(""+result+"\n");

}

process.stdin.resume();

process.stdin.setEncoding('ascii');

var input_stdin = "";

var input_stdin_array = "";

var input_currentline = 0;

process.stdin.on('data', function (data) {

input_stdin += data;

});

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

input_stdin_array = input_stdin.split("\n");

main();

});

function readLine() {

return input_stdin_array[input_currentline++];

}

/////////////// ignore above this line ////////////////////

function solve(year){

if (year == 1918)

return "26.09.1918";

else if (((year <= 1917) && (year%4 == 0)) || ((year%400 == 0) || ((year%4 ==0) & (year%100 != 0))))

return "12.09." + year;

else

return "13.09." + year;

}

function main() {

var year = parseInt(readLine());

var result = solve(year);

process.stdout.write(""+result+"\n");

}

Hackerrank – Drawing Book

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie pre zistenie počtu otočení z predu – počet otočení zo zadu – najprv si zistím, či je párne, ak je potrebujem si určiť stranu na pravej strane knihy a tá je vždy nepárna – musím si urobiť […]

Hackerrank – String Compression

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

object Solution extends App {
  val line = Source.stdin.getLines().toList.head

  val subs = uniformSubstrings(line)
  val substringCompressed = subs.map(s => {
    val length = s.length
    if(length > 1) {
      s.head.toString + length
    } else {
      s.head.toString
    }
  })

  println(substringCompressed.mkString(""))


  def uniformSubstrings(s: String): List[String] = {
    if(s.length <= 0) {
      return Nil
    }
    val c = s.charAt(0)
    val substring = s.takeWhile(_ == c)
    substring :: uniformSubstrings(s.drop(substring.length))
  }
}

object Solution extends App {

val line = Source.stdin.getLines().toList.head

val subs = uniformSubstrings(line)

val substringCompressed = subs.map(s => {

val length = s.length

if(length > 1) {

s.head.toString + length

} else {

s.head.toString

}

})

println(substringCompressed.mkString(""))

def uniformSubstrings(s: String): List[String] = {

if(s.length <= 0) {

return Nil

}

val c = s.charAt(0)

val substring = s.takeWhile(_ == c)

substring :: uniformSubstrings(s.drop(substring.length))

}

Hackerrank – Sherlock and Anagrams

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie To čo je v zadaní. skúmať každé dvojice, ktoré sú anagramy a určiť ich počet. Vytvoril som riešenie v týchto programovacích jazykoch: Java Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class SherlockAndAnagrams
{
    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 string = stdin.nextLine();
            int stringLength = string.length();
            long resultPairs = 0;
            for (int length = 1; length <= stringLength; length++)
            {
                for (int start1 = 0; start1 < stringLength; start1++)
                {
                    for (int start2 = start1 + 1; start2 < stringLength; start2++)
                    {
                        int end1 = start1 + length;
                        int end2 = start2 + length;
                        if(end1 <= stringLength && end2 <= stringLength)
                        {
                            String substring1 = string.substring(start1, end1);
                            String subString2 = string.substring(start2, end2);
                            if(toCharacterCount(substring1).equals(
                                    toCharacterCount(subString2)))
                            {
                                resultPairs++;
                            }
                        }
                    }
                }
            }
            System.out.println(resultPairs);
        }
        stdin.close();
    }

    private static Map<Character, Integer> toCharacterCount(String word)
    {
        Map<Character, Integer> result = new HashMap<>();
        for (char c : word.toCharArray())
        {
            if(result.containsKey(c))
            {
                result.put(c, result.get(c) + 1);
            }
            else
            {
                result.put(c, 1);
            }
        }
        return result;
    }
}

import java.util.HashMap;

import java.util.Map;

import java.util.Scanner;

public class SherlockAndAnagrams

{

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

int stringLength = string.length();

long resultPairs = 0;

for (int length = 1; length <= stringLength; length++)

{

for (int start1 = 0; start1 < stringLength; start1++)

{

for (int start2 = start1 + 1; start2 < stringLength; start2++)

{

int end1 = start1 + length;

int end2 = start2 + length;

if(end1 <= stringLength && end2 <= stringLength)

{

String substring1 = string.substring(start1, end1);

String subString2 = string.substring(start2, end2);

if(toCharacterCount(substring1).equals(

toCharacterCount(subString2)))

{

resultPairs++;

}

System.out.println(resultPairs);

}

stdin.close();

}

private static Map<Character, Integer> toCharacterCount(String word)

{

Map<Character, Integer> result = new HashMap<>();

for (char c : word.toCharArray())

{

if(result.containsKey(c))

{

result.put(c, result.get(c) + 1);

}

else

{

result.put(c, 1);

}

return result;

}

Hackerrank – Missing Numbers (FP)

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Pozri riešenie Missing Numbers.