December 2016 - Page 2 of 3

Hackerrank – Mini-Max Sum

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution If you order the given array ascending – the min sum are first n-1 elements – the max sum are last n-1 elements I created solution in: Scala Java JavaScript Ruby All solutions are also available on my GitHub. Java […]

Hackerrank – Bon Appétit

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution First find a correct amount of money – (food_sum – index_of_allergic) / 2. Compare if the correct amount is equals with given amount. I created solution in: Scala Java JavaScript Ruby All solutions are also available on my GitHub. Java […]

Hackerrank – Sequence full of colors

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Create a recursive function with condition described – see implementation. I created solution in: Scala All solutions are also available on my GitHub. Scala

import scala.io.Source
import scala.collection.mutable.Map

object SequenceFullOfColors extends App {
  val lines = Source.stdin.getLines().toList.tail
  val results = lines.map(fullOfColors).map(_.toString.capitalize)

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

  def fullOfColors(sequence: String): Boolean = {
    val colors = Map.empty[Char, Int]
    def prefixSequences(seq: String, n: Int): Boolean = {
      val char = seq(n)
      val count = colors.getOrElse(char, 0)
      colors.put(char, count + 1)
      if(n < seq.length - 1) {
        val greenCount = colors.getOrElse('G', 0)
        val redCount = colors.getOrElse('R', 0)
        val yellowCount = colors.getOrElse('Y', 0)
        val blueCount = colors.getOrElse('B', 0)
        if((greenCount - redCount).abs <= 1 && (yellowCount - blueCount).abs <= 1) {
          return prefixSequences(seq, n + 1)
        }
        return false
      }
      true
    }

    val condition = prefixSequences(sequence, 0)
    val greenCount = colors.getOrElse('G', 0)
    val redCount = colors.getOrElse('R', 0)
    val yellowCount = colors.getOrElse('Y', 0)
    val blueCount = colors.getOrElse('B', 0)
    condition && (greenCount == redCount) && (yellowCount == blueCount)
  }
}

import scala.io.Source

import scala.collection.mutable.Map

object SequenceFullOfColors extends App {

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

val results = lines.map(fullOfColors).map(_.toString.capitalize)

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

def fullOfColors(sequence: String): Boolean = {

val colors = Map.empty[Char, Int]

def prefixSequences(seq: String, n: Int): Boolean = {

val char = seq(n)

val count = colors.getOrElse(char, 0)

colors.put(char, count + 1)

if(n < seq.length - 1) {

val greenCount = colors.getOrElse('G', 0)

val redCount = colors.getOrElse('R', 0)

val yellowCount = colors.getOrElse('Y', 0)

val blueCount = colors.getOrElse('B', 0)

if((greenCount - redCount).abs <= 1 && (yellowCount - blueCount).abs <= 1) {

return prefixSequences(seq, n + 1)

}

return false

}

true

}

val condition = prefixSequences(sequence, 0)

val greenCount = colors.getOrElse('G', 0)

val redCount = colors.getOrElse('R', 0)

val yellowCount = colors.getOrElse('Y', 0)

val blueCount = colors.getOrElse('B', 0)

condition && (greenCount == redCount) && (yellowCount == blueCount)

}

Hackerrank – Jumping Bunnies

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Calculate the Least Common Multiple of bunnies jumps. I created solution in: Scala All solutions are also available on my GitHub. Scala

import scala.io.Source

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

  val commonPoint = bunnies.foldLeft(BigInt(1))(lcm(_, _))

  println(commonPoint)

  def gcd(x: BigInt, y: BigInt): BigInt = {
    if(y == 0) x else gcd(y, x % y)
  }

  def lcm(x: BigInt, y: BigInt): BigInt = {
    (x * y) / gcd(x, y)
  }
}

import scala.io.Source

object JumpingBunnies extends App {

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

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

val commonPoint = bunnies.foldLeft(BigInt(1))(lcm(_, _))

println(commonPoint)

def gcd(x: BigInt, y: BigInt): BigInt = {

if(y == 0) x else gcd(y, x % y)

}

def lcm(x: BigInt, y: BigInt): BigInt = {

(x * y) / gcd(x, y)

}

Hackerrank – Repeated String

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution The length of a given word repeated could be too much to be able to calculate the result before the time limit. We need to simplify our solution. We have a given string – s. Count only “a” characters in […]

Hackerrank – Viral Advertising

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution For each day calculate how many people like the advertisement. Use the formula from problem description. Then sum all people. I created solution in: Scala Java JavaScript Ruby All solutions are also available on my GitHub. Java

import java.util.*;

public class ViralAdvertising {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int n = Integer.parseInt(stdin.nextLine());
        int totalLiked = 0;
        int dayStartPeople = 5;
        for(int i = 0; i < n; i++) {
            int dayLiked = dayStartPeople / 2;
            int received = dayLiked * 3;
            totalLiked += dayLiked;
            dayStartPeople = received;
        }
        System.out.println(totalLiked);
        stdin.close();
    }
}

import java.util.*;

public class ViralAdvertising {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

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

int totalLiked = 0;

int dayStartPeople = 5;

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

int dayLiked = dayStartPeople / 2;

int received = dayLiked * 3;

totalLiked += dayLiked;

dayStartPeople = received;

}

System.out.println(totalLiked);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    const n = parseInt(input)

    let totalLiked = 0;
    let dayStartPeople = 5;
    for(let i = 0; i < n; i++) {
        const dayLiked = parseInt(dayStartPeople / 2);
        const received = dayLiked * 3;
        totalLiked += dayLiked;
        dayStartPeople = received;
    }
    console.log(totalLiked);
};

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 n = parseInt(input)

let totalLiked = 0;

let dayStartPeople = 5;

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

const dayLiked = parseInt(dayStartPeople / 2);

const received = dayLiked * 3;

totalLiked += dayLiked;

dayStartPeople = received;

}

console.log(totalLiked);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

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

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

[…]

Hackerrank – Apple and Orange

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution You need to calculate how many apples or oranges are within given positions on a line. There is a following condition: I created solution in: Scala Java JavaScript Ruby All solutions are also available on my GitHub. Java […]

Hackerrank – Equalize the Array

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Create groups containing same numbers from defined array. The result is length of the array without size of the biggest groups. Explanation: The only way to make a minimum deletion of other numbers from array. If I would delete any […]

Hackerrank – Sock Merchant

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created groups of socks with same color. Then for each of the group I calculated sock pairs – number_of_socks / 2. The result is the count of all pairs. I created solution in: Scala Java JavaScript Ruby All solutions […]

Hackerrank – Designer PDF Viewer

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Find a max height of given characters. Square is max height multiplied with length of the string. I created solution in: Scala Java JavaScript Ruby All solutions are also available on my GitHub. Java

import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        Object[] heights = Arrays.stream(stdin.nextLine().split(" "))
                .map(Integer::parseInt).toArray();
        String word = stdin.nextLine();
        int maxHeight = 0;
        for(int i = 0; i < word.length(); i++) {
            int charIndex = word.charAt(i) - 'a';
            int height = (int) heights[charIndex];
            if(height > maxHeight) {
                maxHeight = height;
            }
        }

        long square = word.length() * maxHeight;
        System.out.println(square);
        stdin.close();
    }
}

import java.util.*;

public class Solution {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

Object[] heights = Arrays.stream(stdin.nextLine().split(" "))

.map(Integer::parseInt).toArray();

String word = stdin.nextLine();

int maxHeight = 0;

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

int charIndex = word.charAt(i) - 'a';

int height = (int) heights[charIndex];

if(height > maxHeight) {

maxHeight = height;

}

long square = word.length() * maxHeight;

System.out.println(square);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    const lines = input.split('\n');
    const heights = lines[0].split(' ').map(i => parseInt(i));
    const word = lines[1];
    let maxHeight = 0;
    for(let i = 0; i < word.length; i++) {
        const charIndex = word[i].codePointAt() - 97;
        const height = heights[charIndex];
        if(height > maxHeight) {
            maxHeight = height;
        }
    }

    const square = word.length * maxHeight;
    console.log(square);
};

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

const word = lines[1];

let maxHeight = 0;

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

const charIndex = word[i].codePointAt() - 97;

const height = heights[charIndex];

if(height > maxHeight) {

maxHeight = height;

}

const square = word.length * maxHeight;

console.log(square);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

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

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

Scala

import scala.io.Source

object DesignerPdfViewer extends App {
  val lines = Source.stdin.getLines().toList
  val heights = lines.head.split(" ").map(_.toInt)
  val word = lines(1)
  val characterIndexes = word.map(_ - 'a')
  val maxHeight = characterIndexes.map(heights(_)).max

  val square = word.length * maxHeight
  println(square)
}
}

import scala.io.Source

object DesignerPdfViewer extends App {

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

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

val word = lines(1)

val characterIndexes = word.map(_ - 'a')

val maxHeight = characterIndexes.map(heights(_)).max

val square = word.length * maxHeight

println(square)

}

Ruby […]

Pavol Pidanič

I can count to 1023 with 10 fingers

Month: December 2016

Hackerrank – Mini-Max Sum

Hackerrank – Bon Appétit

Hackerrank – Sequence full of colors

Hackerrank – Jumping Bunnies

Hackerrank – Repeated String

Hackerrank – Viral Advertising

Hackerrank – Apple and Orange

Hackerrank – Equalize the Array

Hackerrank – Sock Merchant

Hackerrank – Designer PDF Viewer