Compare the Triplets : HackerRank Solution

Compare the Triplets

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 clarityoriginality, 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 Description

Complete the function compareTriplets in the editor below.

compareTriplets has the following parameter(s):

int a[3]: Alice's challenge rating

int b[3]: Bob's challenge rating

Return

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

In this example:

a = (a[0], a[1], a[2]) = (5,6,7)

b= (b[0],b[1],b[2]) = (3,6,10)

Now, let's compare each individual score:

a[0]>b[0], so Alice receives  point.

a[1]=b[1], so nobody receives a point.

a[2<b[2], so Bob receives  point.

Alice's comparison score is 1, and Bob's comparison score is 1. Thus, we return the array [1,1].

Sample Input 1

17 28 30

99 16 8

Sample Output 1

2 1

Explanation 1

Comparing the  0th elements, 17 < 99 so Bob receives a point.
Comparing the 1st  and 2nd  elements, 28 > 16 and 30 > 8 so Alice receives two points.
The return array is [2,1].

🔍Logic to follow to come-up with the solution :

1. Declare the required sets of variables to use.

2. Take the input number one by one.

3. Declare two variables and initialize them to zero ( i.e., int a=0, b=0; )

4. Now Compare the one variable with the other if the condition follow that is if 1st value of a1 is greater than b1 then increment the a (so, alice recieve one point) or if 1st value of a1 is smaller than b1 then increment b (so, bob recieve one point).

                                                  if(a1>b1)

                                                        a++;

                                                  if(a1<b1)

                                                        b++;

5. Similarly follow the same condition for other variables i.e., a2, b2, a3, b3.

6. Finally print the incremented values of a and b.

👨‍💻Let’s write the required code for the problem :

Code :
 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
38
39
40
41
42
43
44
#include<iostream>
using namespace std;
int main()
{

    int a1,a2,a3;

    cin>>a1>>a2>>a3;

    int b1,b2,b3;

    cin>>b1>>b2>>b3;

    int a=0,b=0;

    if(a1>b1)

     a++;

    if(a1<b1)

     b++;

    if(a2>b2)

     a++;

    if(a2<b2)

     b++;

    if(a3>b3)

     a++;

    if(a3<b3)

     b++;

    cout<<a<<" "<<b;

return 0;

}

Sample Test Cases have been passed successfully

If you liked this post, then share this with your friends and if anything is confusing or incorrect then let me know in the comment section.

Thanks from my side, this is Mayank, keep learning and exploring !!

Next Post Previous Post
No Comment
Add Comment
comment url

Best Buy Products