Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I have given count of numbers n. I will iterate over all numbers from 1 to n I will find index of each iterated number in all elements and then index of index within all elements I created solution in: […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Scala Java JavaScript All solutions are also available on my GitHub profile. Scala
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
object PriyankaAndToys extends App { val lines = Source.stdin.getLines().toList val n = Integer.parseInt(lines.head) val weights = lines.tail.head.split("\\s+").map(_.toInt).sorted var price = 1 var lastWeight = weights(0) var i = 1 while ( { i < weights.length }) { if (lastWeight + 4 >= weights(i)) { // lastWeight = toys[i]; } else { price += 1 lastWeight = weights(i) } { i += 1; i - 1 } } println(price) } |
Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 |
import java.util.Arrays; import java.util.Scanner; public class PriyankaAndToys { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = Integer.parseInt(scanner.nextLine()); String[] weights = scanner.nextLine().split("\\s+"); int[] toyWeights = new int[n]; for (int i = 0; i < n; i++) { toyWeights[i] = Integer.parseInt(weights[i]); } Arrays.sort(toyWeights); int price = 1; int lastWeight = toyWeights[0]; for (int i = 1; i < toyWeights.length; i++) { if(lastWeight + 4 >= toyWeights[i]) { // lastWeight = toys[i]; } else { price++; lastWeight = toyWeights[i]; } } System.out.println(price); scanner.close(); } } |
Javascript
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
'use strict'; const processData = input => { const lines = input.split('\n'); const n = parseInt(lines[0]); const weights = lines[1].split(" ").map(i => parseInt(i)).sort((a, b) => a - b); let price = 1; let lastWeight = weights[0]; for (let i = 1; i < weights.length; i++) { if(lastWeight + 4 >= weights[i]) { // lastWeight = toys[i]; } else { price++; lastWeight = weights[i]; } } console.log(price); }; process.stdin.resume(); process.stdin.setEncoding("ascii"); let _input = ""; process.stdin.on("data", input => _input += input); process.stdin.on("end", () => processData(_input)); |
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution We will use professor’s rules and transform all grades: – We find how many times (n) is 5 in given grade – if it is divisible without a remainder, we do nothing – it not we round it to neareast […]
Hackerrank – Problem description The problem description – Hackerrank. Solution I created an array of all positive numbers, which satisfy conditions specified in problem statement. This set should contain elements from to . I filter all numbers from the set that are valid for an equation a . The array of positive numbers can be […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution We need to find the highest hurdle. If it is greater than k then substract its height with k and we have the result. Otherwise print 0. I created solution in: Scala Java JavaScript Ruby All solutions are also available […]
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 – 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 – 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 – 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
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
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
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 |
'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 – 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 […]