Merge pull request #838 from sir-gon/develop

Develop

Author: sir-gon

src/hackerrank/implementation/migratoryBirds.ts

@@ -17,10 +17,10 @@ function migratoryBirds(arr: number[]): number {
   for (const bird of arr) {
     console.debug(`bird ${bird}`);
 
-    if (!map[bird]) {
-      map[bird] = 1;
-    } else {
+    if (map[bird]) {
       map[bird] += 1;
+    } else {
+      map[bird] = 1;
     }
 
     console.debug(`bird = ${bird} ~> map[bird] = ${map[bird]}`);

src/hackerrank/interview_preparation_kit/dynamic_programming/max_array_sum.ts

@@ -4,7 +4,11 @@
  */
 
 const bigIntMax = (...args: bigint[]): bigint =>
-  args.reduce((m, e) => (e > m ? e : m), BigInt(0));
+  args.reduce((m, e) => {
+    const _e = BigInt(e);
+    const _m = BigInt(m);
+    return _e > _m ? _e : _m;
+  }, BigInt(0));
 
 function maxSubsetSum(arr: number[]): number {
   const arrCopy: bigint[] = arr.map((x: number): bigint => BigInt(x));

src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.ts

@@ -7,7 +7,7 @@ function maxMin(k: number, arr: number[]): number {
     .map((x: number): number => x)
     .sort((a: number, b: number): number => a - b);
 
-  let result = sortedlist[sortedlist.length - 1] - sortedlist[0];
+  let result = (sortedlist.at(-1) ?? 0) - sortedlist[0];
 
   for (let i = 0; i < sortedlist.length - k + 1; i++) {
     const tmin = sortedlist[i];

src/hackerrank/interview_preparation_kit/greedy_algorithms/minimum_absolute_difference_in_an_array.ts

@@ -7,7 +7,7 @@ function minimumAbsoluteDifference(arr: number[]): number {
     .map((x: number): number => x)
     .sort((a: number, b: number): number => b - a);
 
-  let result = Math.abs(sortedNums[sortedNums.length - 1] - sortedNums[0]);
+  let result = Math.abs((sortedNums.at(-1) ?? 0) - sortedNums[0]);
 
   for (let i = 0; i < sortedNums.length - 1; i++) {
     const aValue = sortedNums[i];

src/hackerrank/interview_preparation_kit/sort/ctci_bubble_sort.ts

@@ -7,10 +7,9 @@ const SEPARATOR = '\n';
 class SortableGroup {
   group: number[];
 
-  count: number;
+  count = 0;
 
   constructor(group: number[]) {
-    this.count = 0;
     this.group = group;
   }
 

src/hackerrank/interview_preparation_kit/sort/ctci_comparator_sorting.ts

@@ -53,4 +53,5 @@ export default {
   comparatorSortingPrint
 };
 
-export { Player, SortablePlayer, comparatorSorting, comparatorSortingPrint };
+export { Player } from './ctci_comparator_sorting.Player';
+export { SortablePlayer, comparatorSorting, comparatorSortingPrint };

src/hackerrank/interview_preparation_kit/stacks_and_queues/balanced_brackets.ts

@@ -12,10 +12,7 @@ function isBalancedCompute(s: string): boolean {
   for (const letter of s.split('')) {
     if (letter in pairs) {
       brackets.push(letter);
-    } else if (
-      brackets.length > 0 &&
-      pairs[brackets[brackets.length - 1]] === letter
-    ) {
+    } else if (brackets.length > 0 && pairs[brackets.at(-1) ?? 0] === letter) {
       brackets.pop();
     } else {
       return false;

src/projecteuler/problem0005.ts

@@ -33,7 +33,7 @@ function _replaceMaximum(
   const element = _group.get(_element);
 
   if (element) {
-    _group.set(_element, count > element ? count : element);
+    _group.set(_element, Math.max(count, element));
   } else {
     _group.set(_element, count);
   }

src/projecteuler/problem0007.ts

@@ -22,7 +22,7 @@ function problem0007(_top: number): number {
 
   console.log(`primes count: ${primes.length}`);
 
-  const answer = primes[primes.length - 1];
+  const answer = primes.at(-1) ?? 0;
 
   const cycles = i;
   console.log(`${_top} prime number is: ${answer} in ${cycles} cycles`);

src/projecteuler/problem0017.ts

@@ -12,7 +12,7 @@ function problem0017(init: number, last: number): number {
 
   for (let i = init; i <= last; i++) {
     word = numberToWord(i);
-    replaced = word.replace(/[^a-z0-9]/gi, '');
+    replaced = word.replaceAll(/[^a-z0-9]/gi, '');
 
     acum += replaced.length;