Hello Programmers/Coders, Today we are going to share solutions of Programming problems of HackerRank, Algorithm Solutions of Problem Solving Section in Java. At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.
In this post, you will find the solution for Compare the Triplets in Java-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.
Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.
Introduction To Algorithm
The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon in order to get the expected results.
Advantages of Algorithms:
- It is easy to understand.
- Algorithm is a step-wise representation of a solution to a given problem.
- In Algorithm the problem is broken down into smaller pieces or steps hence, it is easier for the programmer to convert it into an actual program.
Link for the Problem – Compare the Triplets – Hacker Rank Solution
Compare the Triplets – Hacker Rank Solution
Problem:
Alice and Bob each created one problem for HackerRank. A reviewer rates the two challenges, awarding points on a scale from 1 to 100 for three categories: problem clarity, originality, and difficulty.
The rating for Alice’s challenge is the triplet a = (a[0], a[1], a[2]), and the rating for Bob’s challenge is the triplet b = (b[0], b[1], b[2]).
The task is to find their comparison points by comparing a[0] with b[0], a[1] with b[1], and a[2] with b[2].
- If a[i] > b[i], then Alice is awarded 1 point.
- If a[i] < b[i], then Bob is awarded 1 point.
- If a[i] = b[i], then neither person receives a point.
Comparison points is the total points a person earned.
Given a and b, determine their respective comparison points.
Example
a = [1, 2, 3]
b = [3, 2, 1]
- For elements *0*, Bob is awarded a point because a[0] .
- For the equal elements a[1] and b[1], no points are earned.
- Finally, for elements 2, a[2] > b[2] so Alice receives a point.
The return array is [1, 1] with Alice’s score first and Bob’s second.Function DescriptionComplete the function compareTriplets in the editor below.compareTriplets has the following parameter(s):int a[3]: Alice’s challenge ratingint b[3]: Bob’s challenge ratingReturn
- int[2]: Alice’s score is in the first position, and Bob’s score is in the second.
Input Format
The first line contains 3 space-separated integers, a[0], a[1], and a[2], the respective values in triplet a.
The second line contains 3 space-separated integers, b[0], b[1], and b[2], the respective values in triplet b.
Constraints
- 1 ≤ a[i] ≤ 100
- 1 ≤ b[i] ≤ 100
Sample Input 0
5 6 7 3 6 10
Sample Output 0
1 1
Explanation 0
Sample Input 1
17 28 30 99 16 8
Sample Output 1
2 1
Explanation 1
Compare the Triplets – Hacker Rank Solution
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* @author Techno-RJ
*
*/
public class CompareTheTriplets {
static List<Integer> compareTriplets(List<Integer> a, List<Integer> b) {
int aliceTotalScore = 0, bobTotalScore = 0;
for (int i = 0; i < 3; i++) {
int aliceScore = a.get(i);
int bobScore = b.get(i);
if (aliceScore != bobScore) {
int temp = aliceScore > bobScore ? aliceTotalScore++ : bobTotalScore++;
}
}
List<Integer> result = new ArrayList<>();
result.add(aliceTotalScore);
result.add(bobTotalScore);
return result;
}
}
