Archives Hackerrank - Page 8 of 26

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

Hackerrank – Sum vs XOR

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution A mathematical trick. just count total numbers of zero present in binary number of given n, and answer will be the 2 to the power of (total num of zero) Look at the truth table of XOR:

0 ^ 0 = 0
0 ^ 1 = 1
1 ^ 0 = 1
1 ^ 1 = 0

0 ^ 0 = 0

0 ^ 1 = 1

1 ^ 0 = 1

1 ^ 1 = 0

Now look […]

Hackerrank – Super Digit

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

object SuperDigit extends App {
  val line = Source.stdin.bufferedReader().readLine()
  val nk = line.split(" ")
  val n = nk(0)
  val k = nk(1).toInt

  println(superDigit(n, k))

  def superDigit(num: String, k: Int): String = {
    if(num.length == 1) {
      return num
    } else {
      val sum: BigInt = num.foldLeft(BigInt(0))(_ + Character.digit(_, 10)) * k
      return superDigit(sum.toString, 1)
    }
  }
}

import scala.io.Source

object SuperDigit extends App {

val line = Source.stdin.bufferedReader().readLine()

val nk = line.split(" ")

val n = nk(0)

val k = nk(1).toInt

println(superDigit(n, k))

def superDigit(num: String, k: Int): String = {

if(num.length == 1) {

return num

} else {

val sum: BigInt = num.foldLeft(BigInt(0))(_ + Character.digit(_, 10)) * k

return superDigit(sum.toString, 1)

}

Hackerrank – Flatland Space Stations

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Fist I sorted the Space station, because they are not always ordered. Then I found out how many cities are between each pair of space stations i and i+1: Then I calculated the maximum distance for each city […]

Hackerrank – Beautiful Days at the Movies

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution For each number in the given interval between i and j count the numbers with valid given condition. 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);
        int start = stdin.nextInt();
        int end = stdin.nextInt();
        int k = stdin.nextInt();
        int count = 0;
        for(int i = start; i <= end; i++) {
            String s = String.valueOf(i);
            String reversed = new StringBuilder(s).reverse().toString();
            int diff = Math.abs(Integer.parseInt(s) - Integer.parseInt(reversed));
            if(diff % k == 0) {
                count++;
            }
        }
        System.out.println(count);
        stdin.close();
    }
}

import java.util.*;

public class Solution {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int start = stdin.nextInt();

int end = stdin.nextInt();

int k = stdin.nextInt();

int count = 0;

for(int i = start; i <= end; i++) {

String s = String.valueOf(i);

String reversed = new StringBuilder(s).reverse().toString();

int diff = Math.abs(Integer.parseInt(s) - Integer.parseInt(reversed));

if(diff % k == 0) {

count++;

}

System.out.println(count);

stdin.close();

}

JavaScript

'use strict';

const reverse = (s) => s.split("").reverse().join("");

const processData = input => {
    const [start, end, d] = input.split(' ').map(i => parseInt(i));
    let count = 0;
    for(let i = start; i <= end; i++) {
        const s = i.toString();
        const reversed = reverse(s);
        const diff = Math.abs(parseInt(s) - parseInt(reversed));
        if(diff % d == 0) {
            count++;
        }
    }
    console.log(count);
};

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 reverse = (s) => s.split("").reverse().join("");

const processData = input => {

const [start, end, d] = input.split(' ').map(i => parseInt(i));

let count = 0;

for(let i = start; i <= end; i++) {

const s = i.toString();

const reversed = reverse(s);

const diff = Math.abs(parseInt(s) - parseInt(reversed));

if(diff % d == 0) {

count++;

}

console.log(count);

};

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 BeautifulDaysAtTheMovies extends App {
  val nums = Source.stdin.bufferedReader().readLine().split(" ").map(_.toInt)
  val start = nums(0)
  val end = nums(1)
  val d = nums(2)

  val beautifulNum = (start to end).count(num => {
    val reversed = num.toString.reverse.toInt
    val diff = (num - reversed).abs
    diff % d == 0
  })

  println(beautifulNum)
}

import scala.io.Source

object BeautifulDaysAtTheMovies extends App {

val nums = Source.stdin.bufferedReader().readLine().split(" ").map(_.toInt)

val start = nums(0)

val end = nums(1)

val d = nums(2)

val beautifulNum = (start to end).count(num => {

val reversed = num.toString.reverse.toInt

val diff = (num - reversed).abs

diff % d == 0

})

println(beautifulNum)

}

[…]

Hackerrank – Compute the Perimeter of a Polygon

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Calculate a length of a line between each pair of following points p, defined with x and y coordinate: (p0, p1), (p1, p2), …, (pn-1, p0) Length of a line between two points: $$l = \sqrt{{(x_1 – x_2)}^2 + {(y_1 […]

Hackerrank – Compute the Area of a Polygon

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Create matrices of point pairs as follows

|x1 x2|
|y1 y2|

1 2	\|x1 x2\| \|y1 y2\|

|x2 x3|
|y2 y3|

1 2	\|x2 x3\| \|y2 y3\|

… Calculate the determinat of each matrix: x1 * y2 – x2 * y1 And sum the determinants. In the end divide the sum with 2. Solution based on this. I […]

Hackerrank – Remove Duplicates

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

object RemoveDuplicates extends App {
  println(Console.readLine.distinct)
}

object RemoveDuplicates extends App {

println(Console.readLine.distinct)

}

Hackerrank – Lambda Calculus – Reductions #4

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

CAN'T REDUCE

1	CAN'T REDUCE

Hackerrank – Lambda Calculus – Reductions #3

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

CAN'T REDUCE

1	CAN'T REDUCE

Pavol Pidanič

I can count to 1023 with 10 fingers

Category: Hackerrank

Hackerrank – Designer PDF Viewer

Hackerrank – Sum vs XOR

Hackerrank – Super Digit

Hackerrank – Flatland Space Stations

Hackerrank – Beautiful Days at the Movies

Hackerrank – Compute the Perimeter of a Polygon

Hackerrank – Compute the Area of a Polygon

Hackerrank – Remove Duplicates

Hackerrank – Lambda Calculus – Reductions #4

Hackerrank – Lambda Calculus – Reductions #3