[Hacker Rank] Interview Preparation Kit: Arrays: Left Rotation. Solved ✅. Adjusted the interface to match what hackerrank expects.

Author: Gonzalo Diaz

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

@@ -1,7 +1,7 @@
 import { describe, expect, it } from '@jest/globals';
 import { logger as console } from '../../../logger';
 
-import { rotLeft, rotLeftOne } from './ctci_array_left_rotation';
+import arrayLeftRotation from './ctci_array_left_rotation';
 
 import ROT_LEFT_ONE_TEST_CASES from './ctci_array_left_rotation.testcases.json';
 
@@ -11,7 +11,7 @@ describe('ctci_array_left_rotation', () => {
 
     ROT_LEFT_ONE_TEST_CASES.forEach((test) => {
       const input = test.numbers;
-      const answer = rotLeftOne(input);
+      const answer = arrayLeftRotation.rotLeftOne(input);
 
       console.debug(
         `rotLeftOne(${test.numbers.toString()}) solution found: ${answer.toString()}`
@@ -29,7 +29,10 @@ describe('ctci_array_left_rotation', () => {
     ];
 
     ROT_LEFT_TEST_CASES.forEach((value) => {
-      const answer = rotLeft(value.numbers, value.d_rotations);
+      const answer = arrayLeftRotation.rotLeft(
+        value.numbers,
+        value.d_rotations
+      );
 
       console.debug(
         `rotLeft(${value.numbers.toString()}) solution found: ${answer.toString()}`

src/hackerrank/interview_preparation_kit/arrays/ctci_array_left_rotation.ts

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