Refactor

src/hackerrank/implementation/betweenTwoSets.ts

@@ -2,7 +2,7 @@
  * @link Problem definition [[docs/hackerrank/implementation/betweenTwoSets.md]]
  */
 
-export function isFactor(n: number, group: number[]): boolean {
+function isFactor(n: number, group: number[]): boolean {
   let result = true;
   let i = 0;
 
@@ -19,7 +19,7 @@ export function isFactor(n: number, group: number[]): boolean {
   return result;
 }
 
-export function factorOf(n: number, group: number[]): boolean {
+function factorOf(n: number, group: number[]): boolean {
   let result = true;
   let i = 0;
 
@@ -36,7 +36,7 @@ export function factorOf(n: number, group: number[]): boolean {
   return result;
 }
 
-export function getTotalX(a: number[], b: number[]): number {
+function getTotalX(a: number[], b: number[]): number {
   let max = 0;
   for (const j of b) {
     if (j > max) max = j;
@@ -53,4 +53,5 @@ export function getTotalX(a: number[], b: number[]): number {
   return result.length;
 }
 
-export default { getTotalX };
+export default { getTotalX, factorOf, isFactor };
+export { getTotalX, factorOf, isFactor };

src/hackerrank/implementation/birthday.ts

@@ -4,7 +4,7 @@
 
 import { logger as console } from '../../logger';
 
-export function birthday(s: number[], d: number, m: number): number {
+function birthday(s: number[], d: number, m: number): number {
   let result = 0;
   console.debug(`s: ${s.toString()}`);
 
@@ -23,3 +23,4 @@ export function birthday(s: number[], d: number, m: number): number {
 }
 
 export default { birthday };
+export { birthday };

src/hackerrank/implementation/bonAppetit.ts

@@ -4,7 +4,7 @@
 
 import { logger as console } from '../../logger';
 
-export function bonAppetit(bill: number[], k: number, b: number): string {
+function bonAppetit(bill: number[], k: number, b: number): string {
   const totalSum = bill.reduce(
     (previousValue, currentValue) => previousValue + currentValue,
     0
@@ -25,3 +25,4 @@ export function bonAppetit(bill: number[], k: number, b: number): string {
 }
 
 export default { bonAppetit };
+export { bonAppetit };

src/hackerrank/implementation/breakingRecords.ts

@@ -2,7 +2,7 @@
  * @link Problem definition [[docs/hackerrank/implementation/breakingRecords.md]]
  */
 
-export function breakingRecords(scores: number[]): number[] {
+function breakingRecords(scores: number[]): number[] {
   if (scores.length === 0) {
     throw new Error('Empty input');
   }
@@ -29,3 +29,4 @@ export function breakingRecords(scores: number[]): number[] {
 }
 
 export default { breakingRecords };
+export { breakingRecords };

src/hackerrank/implementation/countApplesAndOranges.ts

@@ -2,7 +2,7 @@
  * @link Problem definition [[docs/hackerrank/implementation/countApplesAndOranges.md]]
  */
 
-export function countApplesAndOranges(
+function countApplesAndOranges(
   s: number,
   t: number,
   a: number,
@@ -33,3 +33,4 @@ export function countApplesAndOranges(
 }
 
 export default { countApplesAndOranges };
+export { countApplesAndOranges };

src/hackerrank/implementation/countingValleys.ts

@@ -4,7 +4,7 @@
 
 import { logger as console } from '../../logger';
 
-export function countingValleys(steps: number, path: string): number {
+function countingValleys(steps: number, path: string): number {
   const stepList = path.split('');
   let altitude = 0;
   let valleys = 0;
@@ -27,3 +27,4 @@ export function countingValleys(steps: number, path: string): number {
 }
 
 export default { countingValleys };
+export { countingValleys };

src/hackerrank/implementation/dayOfProgrammer.ts

@@ -8,7 +8,7 @@ import { MonthNumbers, daysInMonthNumber } from '../../constants';
 const zeroPad = (num: number, places: number): string =>
   String(num).padStart(places, '0');
 
-export function dayOfProgrammer(year: number): string {
+function dayOfProgrammer(year: number): string {
   const dayToSearch = 256;
   let leap: number;
 
@@ -52,3 +52,4 @@ export function dayOfProgrammer(year: number): string {
 }
 
 export default { dayOfProgrammer };
+export { dayOfProgrammer };

src/hackerrank/implementation/divisibleSumPairs.ts

@@ -4,7 +4,7 @@
 
 import { logger as console } from '../../logger';
 
-export function divisibleSumPairs(n: number, k: number, ar: number[]): number {
+function divisibleSumPairs(n: number, k: number, ar: number[]): number {
   let pairs = 0;
   for (let i = 0; i < ar.length; i++) {
     for (let j = i + 1; j < ar.length; j++) {
@@ -19,3 +19,4 @@ export function divisibleSumPairs(n: number, k: number, ar: number[]): number {
 }
 
 export default { divisibleSumPairs };
+export { divisibleSumPairs };

src/hackerrank/implementation/gradingStudents.ts

@@ -2,7 +2,7 @@
  * @link Problem definition [[docs/hackerrank/implementation/gradingStudents.md]]
  */
 
-export function gradingStudents(grades: number[]): number[] {
+function gradingStudents(grades: number[]): number[] {
   const minimum = 38;
   const roundTo = 5;
   const result: number[] = [];
@@ -23,3 +23,4 @@ export function gradingStudents(grades: number[]): number[] {
 }
 
 export default { gradingStudents };
+export { gradingStudents };

src/hackerrank/implementation/jumpingOnClouds.ts

@@ -4,7 +4,7 @@
 
 import { logger as console } from '../../logger';
 
-export function jumpingOnClouds(c: number[]): number {
+function jumpingOnClouds(c: number[]): number {
   let result = 0;
   let key = 0;
 
@@ -26,3 +26,4 @@ export function jumpingOnClouds(c: number[]): number {
 }
 
 export default { jumpingOnClouds };
+export { jumpingOnClouds };

src/hackerrank/implementation/kangaroo.ts

@@ -2,12 +2,7 @@
  * @link Problem definition [[docs/hackerrank/implementation/kangaroo.md]]
  */
 
-export function kangaroo(
-  x1: number,
-  v1: number,
-  x2: number,
-  v2: number
-): string {
+function kangaroo(x1: number, v1: number, x2: number, v2: number): string {
   if (v1 === v2) {
     if (x1 !== x2) return 'NO';
     return 'YES';
@@ -23,3 +18,4 @@ export function kangaroo(
 }
 
 export default { kangaroo };
+export { kangaroo };

src/hackerrank/implementation/migratoryBirds.ts

@@ -6,7 +6,7 @@ import { logger as console } from '../../logger';
 
 type Birds = Record<string, number>;
 
-export function migratoryBirds(arr: number[]): number {
+function migratoryBirds(arr: number[]): number {
   if (arr.length === 0) {
     throw new Error('Empty input');
   }
@@ -36,3 +36,4 @@ export function migratoryBirds(arr: number[]): number {
 }
 
 export default { migratoryBirds };
+export { migratoryBirds };

src/hackerrank/implementation/minimumAbsoluteDifference.ts

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

src/hackerrank/implementation/repeatedString.ts

@@ -4,7 +4,7 @@
 
 import { logger as console } from '../../logger';
 
-export function countAs(word: string): number {
+function countAs(word: string): number {
   let result = 0;
 
   const chars = word.split('');
@@ -18,7 +18,7 @@ export function countAs(word: string): number {
   return result;
 }
 
-export function repeatedString(s: string, n: number): number {
+function repeatedString(s: string, n: number): number {
   let result = 0;
 
   const blockSize = s.length;
@@ -32,4 +32,5 @@ export function repeatedString(s: string, n: number): number {
   return result;
 }
 
-export default { countAs };
+export default { countAs, repeatedString };
+export { countAs, repeatedString };

src/hackerrank/implementation/sockMerchant.ts

@@ -4,7 +4,7 @@
 
 import { logger as console } from '../../logger';
 
-export function sockMerchant(n: number, ar: number[]): number {
+function sockMerchant(n: number, ar: number[]): number {
   let result = 0;
 
   type Matches = Record<string, number>;
@@ -27,3 +27,4 @@ export function sockMerchant(n: number, ar: number[]): number {
 }
 
 export default { sockMerchant };
+export { sockMerchant };

src/hackerrank/interview_preparation_kit/arrays/2d_array.ts

@@ -2,7 +2,7 @@
  * @link Problem definition [[docs/hackerrank/interview_preparation_kit/arrays/2d_array.md]]
  */
 
-export function gethourGlass(
+function gethourGlass(
   arr: number[][],
   positionX: number,
   positionY: number
@@ -22,7 +22,7 @@ export function gethourGlass(
   return result;
 }
 
-export function hourglassSum(arr: number[][]): number | null {
+function hourglassSum(arr: number[][]): number | null {
   let matrixSize = 0;
 
   if (arr?.[0]) {
@@ -65,3 +65,4 @@ export function hourglassSum(arr: number[][]): number | null {
 }
 
 export default { hourglassSum };
+export { hourglassSum };

src/hackerrank/interview_preparation_kit/arrays/cruch_bruteforce.ts

@@ -5,7 +5,7 @@
 
 import { logger as console } from '../../../logger';
 
-export function arrayManipulation(n: number, queries: number[][]): number {
+function arrayManipulation(n: number, queries: number[][]): number {
   const LENGTH = n + 1;
   const SURROGATE_VALUE = 0;
   const result: number[] = Array<number>(LENGTH).fill(SURROGATE_VALUE);
@@ -29,3 +29,4 @@ export function arrayManipulation(n: number, queries: number[][]): number {
 }
 
 export default { arrayManipulation };
+export { arrayManipulation };

src/hackerrank/interview_preparation_kit/arrays/cruch_optimized.ts

@@ -2,7 +2,7 @@
  * @link Problem definition [[docs/hackerrank/interview_preparation_kit/arrays/crush.md]]
  */
 
-export function arrayManipulation(n: number, queries: number[][]): number {
+function arrayManipulation(n: number, queries: number[][]): number {
   // why adding 2?
   //   first slot to adjust 1-based index and
   //   last slot for storing accumSum result
@@ -29,3 +29,4 @@ export function arrayManipulation(n: number, queries: number[][]): number {
 }
 
 export default { arrayManipulation };
+export { arrayManipulation };

src/hackerrank/interview_preparation_kit/arrays/cruch_testcases_test.json

@@ -3,70 +3,30 @@
     "title": "Sample Test Case 0",
     "n": 5,
     "queries": [
-      [
-        1,
-        2,
-        100
-      ],
-      [
-        2,
-        5,
-        100
-      ],
-      [
-        3,
-        4,
-        100
-      ]
+      [1, 2, 100],
+      [2, 5, 100],
+      [3, 4, 100]
     ],
     "expected": 200
   },
   {
     "title": "Sample Test Case 1",
     "n": 10,
     "queries": [
-      [
-        1,
-        5,
-        3
-      ],
-      [
-        4,
-        8,
-        7
-      ],
-      [
-        6,
-        9,
-        1
-      ]
+      [1, 5, 3],
+      [4, 8, 7],
+      [6, 9, 1]
     ],
     "expected": 10
   },
   {
     "title": "Sample Test Case 3",
     "n": 10,
     "queries": [
-      [
-        2,
-        6,
-        8
-      ],
-      [
-        3,
-        5,
-        7
-      ],
-      [
-        1,
-        8,
-        1
-      ],
-      [
-        5,
-        9,
-        15
-      ]
+      [2, 6, 8],
+      [3, 5, 7],
+      [1, 8, 1],
+      [5, 9, 15]
     ],
     "expected": 31
   }