[REFACTOR] ESLint auto fixes

Author: Gonzalo Diaz

src/hackerrank/implementation/bonAppetit.ts

@@ -5,9 +5,10 @@
 import { logger as console } from '../../logger';
 
 export function bonAppetit(bill: number[], k: number, b: number): string {
-  const totalSum = bill.reduce((previousValue, currentValue) => {
-    return previousValue + currentValue;
-  }, 0);
+  const totalSum = bill.reduce(
+    (previousValue, currentValue) => previousValue + currentValue,
+    0
+  );
 
   const billActual = (totalSum - bill[k]) / 2;
   const account = b - billActual;

src/hackerrank/implementation/dayOfProgrammer.ts

@@ -24,12 +24,12 @@ export function dayOfProgrammer(year: number): string {
     leap = (year % 4 === 0 && year % 100 !== 0) || year % 400 === 0 ? 1 : 0;
   }
 
-  copyOfdaysInMonthNumber[2] = copyOfdaysInMonthNumber[2] + leap;
+  copyOfdaysInMonthNumber[2] += leap;
 
   // transition year
   if (year === 1918) {
     const adjustDaysIn1918 = 13;
-    copyOfdaysInMonthNumber[2] = copyOfdaysInMonthNumber[2] - adjustDaysIn1918;
+    copyOfdaysInMonthNumber[2] -= adjustDaysIn1918;
   }
 
   let accumDays = 0;

src/hackerrank/interview_preparation_kit/greedy_algorithms/luck-balance.ts

@@ -4,6 +4,7 @@
 
 class Contest {
   luck: number;
+
   important: number;
 
   constructor(luck: number, important: number) {

src/hackerrank/interview_preparation_kit/miscellaneous/friend_circle_queries.ts

@@ -4,6 +4,7 @@
 
 class GropingFriends {
   _friendship: Record<number, number> = {};
+
   _large_friendship: number = 0;
 
   constructor() {

src/hackerrank/interview_preparation_kit/recursion_and_backtracking/ctci_recursive_staircase.ts

@@ -8,7 +8,9 @@ const STEPS_LIMIT = 3;
 
 export class StepPerms {
   TOP_LIMIT = 1;
+
   STEPS_LIMIT = 1;
+
   CACHE: Record<number, number> = {};
 
   constructor(top_limit: number, steps_limit: number) {
@@ -17,7 +19,7 @@ export class StepPerms {
   }
 
   step_perms_comput_with_cache(n_steps: number): number {
-    if (0 <= n_steps && n_steps <= 2) {
+    if (n_steps >= 0 && n_steps <= 2) {
       return n_steps;
     }
 

src/hackerrank/lib/Node.ts

@@ -2,7 +2,9 @@
 
 export class Node<T> {
   left: Node<T> | null;
+
   right: Node<T> | null;
+
   data: T;
 
   constructor(data: T) {

src/hackerrank/projecteuler/euler001.ts

@@ -18,7 +18,7 @@ export function sum_ap(n: number, d: number): number {
 // Function to find the sum of all multiples of a and b below n
 export function euler001(a: number, b: number, n: number): number {
   // Since, we need the sum of multiples less than N
-  n = n - 1;
+  n -= 1;
   const lcm = Math.floor((a * b) / gcd(a, b));
 
   return sum_ap(n, a) + sum_ap(n, b) - sum_ap(n, lcm);

src/hackerrank/warmup/compareTriplets.ts

@@ -2,8 +2,6 @@
  * @link Problem definition [[docs/hackerrank/warmup/compareTriplets.md]]
  */
 
-'use strict';
-
 export function compareTriplets(a: number[], b: number[]): number[] {
   const awards = [0, 0];
 
@@ -13,9 +11,9 @@ export function compareTriplets(a: number[], b: number[]): number[] {
 
   for (let i = 0; i < a.length; i++) {
     if (a[i] > b[i]) {
-      awards[0] = awards[0] + 1;
+      awards[0] += 1;
     } else if (a[i] < b[i]) {
-      awards[1] = awards[1] + 1;
+      awards[1] += 1;
     }
   }
 

src/hackerrank/warmup/simpleArraySum.test.ts

@@ -1,9 +1,8 @@
+import { describe, expect, it } from '@jest/globals';
 import { logger as console } from '../../logger';
 
 import { simpleArraySum } from './simpleArraySum';
 
-import { describe, expect, it } from '@jest/globals';
-
 describe('problem simpleArraySum', () => {
   it('problem simpleArraySum Test case 0', () => {
     expect.assertions(1);

src/hackerrank/warmup/simpleArraySum.ts

@@ -2,8 +2,6 @@
  * @link Problem definition [[docs/hackerrank/warmup/simpleArraySum.md]]
  */
 
-'use strict';
-
 export function simpleArraySum(ar: number[]): number {
   let acum = 0;