[REFACTOR] ESLint manual fixes

Author: Gonzalo Diaz

src/hackerrank/implementation/breakingRecords.ts

@@ -3,7 +3,7 @@
  */
 
 export function breakingRecords(scores: number[]): number[] {
-  if (scores.length == 0) {
+  if (scores.length === 0) {
     throw new Error('Empty input');
   }
 

src/hackerrank/implementation/kangaroo.ts

@@ -8,8 +8,8 @@ export function kangaroo(
   x2: number,
   v2: number
 ): string {
-  if (v1 == v2) {
-    if (x1 != x2) return 'NO';
+  if (v1 === v2) {
+    if (x1 !== x2) return 'NO';
     return 'YES';
   }
 

src/hackerrank/implementation/migratoryBirds.ts

@@ -9,7 +9,7 @@ interface Birds {
 }
 
 export function migratoryBirds(arr: number[]): number {
-  if (arr.length == 0) {
+  if (arr.length === 0) {
     throw new Error('Empty input');
   }
 
@@ -28,7 +28,7 @@ export function migratoryBirds(arr: number[]): number {
     console.debug(`bird = ${bird} ~> map[bird] = ${map[bird]}`);
     console.debug(`max = ${max} ~> map[max] = ${map[max]}`);
 
-    if (map[bird] > map[max] || (map[bird] == map[max] && bird < max))
+    if (map[bird] > map[max] || (map[bird] === map[max] && bird < max))
       max = bird;
   }
 

src/hackerrank/implementation/minimumAbsoluteDifference.ts

@@ -5,7 +5,7 @@
 import { logger as console } from '../../logger';
 
 export function minimumAbsoluteDifference(arr: number[]): number {
-  if (arr.length == 0) {
+  if (arr.length === 0) {
     throw new Error('Empty input');
   }
 

src/hackerrank/implementation/sockMerchant.ts

@@ -19,10 +19,10 @@ export function sockMerchant(n: number, ar: number[]): number {
 
   console.debug(matches);
 
-  for (const k in matches) {
-    console.debug(matches[k]);
+  for (const match of Object.values(matches)) {
+    console.debug(match);
 
-    result += Math.floor(matches[k] / 2);
+    result += Math.floor(match / 2);
   }
 
   return result;

src/hackerrank/interview_preparation_kit/arrays/cruch_bruteforce.test.ts

@@ -1,7 +1,7 @@
 import { describe, expect, it } from '@jest/globals';
 import { logger as console } from '../../../logger';
 
-import { default as TEST_CASES } from './cruch_testcases_test.json';
+import TEST_CASES from './cruch_testcases_test.json';
 
 import { arrayManipulation } from './cruch_bruteforce';
 

src/hackerrank/interview_preparation_kit/arrays/cruch_bruteforce.ts

@@ -12,11 +12,11 @@ export function arrayManipulation(n: number, queries: number[][]): number {
   let maximum = 0;
 
   queries.forEach((query) => {
-    const [a_start, b_end, k_value] = query;
+    const [aStart, bEnd, kValue] = query;
     console.debug(`start -> ${result}`);
 
-    for (let i = a_start; i <= b_end; i++) {
-      result[i] += k_value;
+    for (let i = aStart; i <= bEnd; i++) {
+      result[i] += kValue;
       console.debug(`result -> ${result}`);
     }
   });
@@ -27,3 +27,5 @@ export function arrayManipulation(n: number, queries: number[][]): number {
 
   return maximum;
 }
+
+export default { arrayManipulation };

src/hackerrank/interview_preparation_kit/arrays/cruch_optimized.test.ts

@@ -1,7 +1,7 @@
 import { describe, expect, it } from '@jest/globals';
 import { logger as console } from '../../../logger';
 
-import { default as TEST_CASES } from './cruch_testcases_test.json';
+import TEST_CASES from './cruch_testcases_test.json';
 
 import { arrayManipulation } from './cruch_optimized';
 

src/hackerrank/interview_preparation_kit/arrays/cruch_optimized.ts

@@ -5,25 +5,27 @@
 export function arrayManipulation(n: number, queries: number[][]): number {
   // why adding 2?
   //   first slot to adjust 1-based index and
-  //   last slot for storing accum_sum result
+  //   last slot for storing accumSum result
   const LENGTH = n + 2;
   const INITIAL_VALUE = 0;
   const result = Array(LENGTH).fill(INITIAL_VALUE);
   let maximum = 0;
 
   queries.forEach((query) => {
-    const [a_start, b_end, k_value] = query;
+    const [aStart, bEnd, kValue] = query;
 
-    result[a_start] += k_value;
-    result[b_end + 1] -= k_value;
+    result[aStart] += kValue;
+    result[bEnd + 1] -= kValue;
   });
 
-  let accum_sum = 0;
+  let accumSum = 0;
 
   result.forEach((value) => {
-    accum_sum += value;
-    maximum = Math.max(maximum, accum_sum);
+    accumSum += value;
+    maximum = Math.max(maximum, accumSum);
   });
 
   return maximum;
 }
+
+export default { arrayManipulation };

src/hackerrank/interview_preparation_kit/arrays/ctci_array_left_rotation.ts

@@ -2,19 +2,19 @@
  * @link Problem definition [[docs/hackerrank/interview_preparation_kit/arrays/ctci_array_left_rotation.md]]
  */
 
-export function rotLeftOne(a_numbers: number[]): number[] {
-  const first = a_numbers.shift();
-  if (first != undefined) {
-    a_numbers.push(first);
+export function rotLeftOne(aNumbers: number[]): number[] {
+  const first = aNumbers.shift();
+  if (first !== undefined) {
+    aNumbers.push(first);
   }
 
-  return a_numbers;
+  return aNumbers;
 }
 
-export function rotLeft(a_numbers: number[], d_rotations: number): number[] {
-  let output = [...a_numbers];
+export function rotLeft(aNumbers: number[], dRotations: number): number[] {
+  let output = [...aNumbers];
 
-  for (let i = 0; i < d_rotations; i++) {
+  for (let i = 0; i < dRotations; i++) {
     output = rotLeftOne(output);
   }