| 
 | 1 | +# [Compare the Triplets](https://www.hackerrank.com/challenges/compare-the-triplets)  | 
 | 2 | + | 
 | 3 | +Difficulty: #easy  | 
 | 4 | +Category: #warmup  | 
 | 5 | + | 
 | 6 | +Alice and Bob each created one problem for HackerRank. A reviewer rates the two  | 
 | 7 | +challenges, awarding points on a scale from 1 to 100 for three categories:  | 
 | 8 | +problem clarity, originality, and difficulty.  | 
 | 9 | +The rating for Alice's challenge is the triplet $ a = (a[0], a[1], a[2]) $,  | 
 | 10 | +and the rating for Bob's challenge is the triplet $ b = (b[0], b[1], b[2]) $.  | 
 | 11 | + | 
 | 12 | +The task is to find their comparison points by comparing $ a[0] $ with  | 
 | 13 | +$ b[0] $, $ a[1] $ with $ b[1] $, and $ a[2] $ with $ b[2] $.  | 
 | 14 | + | 
 | 15 | +- If $ a[i] > b[i] $, then Alice is awarded $ 1 $ point.  | 
 | 16 | +- If $ a[i] < b[i] $, then Bob is awarded $ 1 $ point.  | 
 | 17 | +- If $ a[i] = b[i] $, then neither person receives a point.  | 
 | 18 | + | 
 | 19 | +Comparison points is the total points a person earned.  | 
 | 20 | +Given a and b, determine their respective comparison points.  | 
 | 21 | + | 
 | 22 | +## Example  | 
 | 23 | + | 
 | 24 | +$ a = [1, 2, 3] $ \  | 
 | 25 | +$ b = [3, 2, 1] $  | 
 | 26 | + | 
 | 27 | +- For elements \*0\*, Bob is awarded a point because $ a[0] $.  | 
 | 28 | +- For the equal elements $ a[1] $ and $ b[1] $, no points are earned.  | 
 | 29 | +- Finally, for elements $ 2 $, $ a[2] > b[2] $ so Alice receives a point.  | 
 | 30 | + | 
 | 31 | +The return array is $ [1, 1] $ with Alice's score first and Bob's second.  | 
 | 32 | + | 
 | 33 | +## Function Description  | 
 | 34 | + | 
 | 35 | +Complete the function compareTriplets in the editor below.  | 
 | 36 | +compareTriplets has the following parameter(s):  | 
 | 37 | + | 
 | 38 | +- int a[3]: Alice's challenge rating  | 
 | 39 | +- int b[3]: Bob's challenge rating  | 
 | 40 | + | 
 | 41 | +## Return  | 
 | 42 | + | 
 | 43 | +- int[2]: Alice's score is in the first position, and Bob's score is in the second.  | 
 | 44 | + | 
 | 45 | +## Input Format  | 
 | 46 | + | 
 | 47 | +The first line contains 3 space-separated integers, $ a[0] $, $ a[1] $, and  | 
 | 48 | +$ a[2] $, the respective values in triplet a.  | 
 | 49 | +The second line contains 3 space-separated integers, $ b[0] $, $ b[1] $, and  | 
 | 50 | +$ b[2] $, the respective values in triplet b.  | 
 | 51 | + | 
 | 52 | +## Constraints  | 
 | 53 | + | 
 | 54 | +- $ 1 \leq a[i] \leq 100 $  | 
 | 55 | +- $ 1 \leq b[i] \leq 100 $  | 
 | 56 | + | 
 | 57 | +## Sample Input 0  | 
 | 58 | + | 
 | 59 | +```text  | 
 | 60 | +5 6 7  | 
 | 61 | +3 6 10  | 
 | 62 | +```  | 
 | 63 | + | 
 | 64 | +## Sample Output 0  | 
 | 65 | + | 
 | 66 | +```text  | 
 | 67 | +1 1  | 
 | 68 | +```  | 
 | 69 | + | 
 | 70 | +## Explanation 0  | 
 | 71 | + | 
 | 72 | +In this example:  | 
 | 73 | + | 
 | 74 | +- $ a = (a[0], a[1], a[2]) = (5, 6, 7) $  | 
 | 75 | +- $ b = (b[0], b[1], b[2]) = (3, 6, 10) $  | 
 | 76 | + | 
 | 77 | +Now, let's compare each individual score:  | 
 | 78 | + | 
 | 79 | +- $ a[0] > b[0] $, so Alice receives $ 1 $ point. \  | 
 | 80 | +- $ a[1] = b[1] $, so nobody receives a point. \  | 
 | 81 | +- $ a[2] < b[2] $, so Bob receives $ 1 $ point.  | 
 | 82 | + | 
 | 83 | +Alice's comparison score is $ 1 $, and Bob's comparison score is $ 1 $.  | 
 | 84 | +Thus, we return the array $ [1, 1] $.  | 
 | 85 | + | 
 | 86 | +## Sample Input 1  | 
 | 87 | + | 
 | 88 | +```text  | 
 | 89 | +17 28 30  | 
 | 90 | +99 16 8  | 
 | 91 | +```  | 
 | 92 | + | 
 | 93 | +## Sample Output 1  | 
 | 94 | + | 
 | 95 | +```text  | 
 | 96 | +2 1  | 
 | 97 | +```  | 
 | 98 | + | 
 | 99 | +## Explanation 1  | 
 | 100 | + | 
 | 101 | +Comparing the *0th* elements, $ 17 < 99 $ so Bob receives a point.  | 
 | 102 | +Comparing the *1st* and *2nd* elements $ 28 > 16 $ and $ 30 > 8 $ so Alice  | 
 | 103 | + receives two points.  | 
 | 104 | +The return array is $ [2, 1] $.  | 
0 commit comments