Merge pull request #76 from wakidurrahman/feat/problem-solving-02

feat: compareTripletsVariationOne

Author: wakidurrahman

src/hackerrank/problem-solving/algorithms-001-001.ts

@@ -21,3 +21,56 @@ function simpleArraySum(ar: number[]): number {
   // Return the sum of the array
   return sum;
 }
+
+// 003: compare the triplets
+
+/*
+ * Complete the 'compareTriplets' function below.
+ *
+ * The function is expected to return an INTEGER_ARRAY.
+ * The function accepts following parameters:
+ *  1. INTEGER_ARRAY a
+ *  2. INTEGER_ARRAY b
+ */
+
+function compareTriplets(a: number[], b: number[]): number[] {
+  const score: number[] = [];
+  let pointOfAlice: number = 0;
+  let pointOfBob: number = 0;
+  // Alice and Bob
+  // input a = [1, 2, 3] , b  = [3, 4, 1]
+  // comparison a[i] > b[i], a[i] < b[i] , a[i] == b[i]
+  // retrun array [1, 1] pointOfAlice and Bob score position
+
+  for (let i = 0; i <= 2; i++) {
+    if (a[i] == b[i]) {
+      pointOfAlice;
+      pointOfBob;
+    } else if (a[i] > b[i]) {
+      pointOfAlice += 1;
+    } else if (a[i] < b[i]) {
+      pointOfBob += 1;
+    }
+  }
+
+  return score.concat(pointOfAlice, pointOfBob);
+}
+
+function compareTripletsVariationOne(a: number[], b: number[]): number[] {
+  let pointOfAlice: number = 0;
+  let pointOfBob: number = 0;
+  // Alice and Bob
+  // input a = [1, 2, 3] , b  = [3, 4, 1]
+  // comparison a[i] > b[i], a[i] < b[i] , a[i] == b[i]
+  // retrun array [1, 1] pointOfAlice and Bob score position
+
+  for (let i = 0; i < a.length; i++) {
+    if (a[i] > b[i]) {
+      pointOfAlice += 1;
+    } else if (a[i] < b[i]) {
+      pointOfBob += 1;
+    }
+  }
+
+  return [pointOfAlice, pointOfBob];
+}