Added more variant solutions to some problems

Author: ParrotStone

Equalize-the-array/main.js

@@ -12,11 +12,19 @@ function equalizeArray(arr) {
  }
 
  return minLength;
+
+ // // A more efficient solution, O(n) time complexity
+ // // Array for counting the frequency, also called Hashmap
+ // const frequency = [];
+
+ // for (let i = 0; i <= 100; i++) frequency[i] = 0;
+ // for (let i = 0; i < arr.length; i++) frequency[arr[i]]++;
+
+ // return arr.length - Math.max(...frequency);
 }
 
 // Test cases
 console.log(equalizeArray([1, 2, 2, 3])); // 2
 console.log(equalizeArray([3, 3, 2, 1, 3])); // 2
 console.log(equalizeArray([1, 2, 3, 1, 2, 3, 3, 3])); // 4
 console.log(equalizeArray([-1, 2, -1, 1, 2, 3, 3, 3])); // 5
-

Halloween Sale/main.js

@@ -7,6 +7,8 @@ function howManyGames(p, d, m, s) {
  while (s >= m && (s - p) >= 0) {
  s -= p;
  p = ((p - d) <= m) ? m : (p - d);
+ // OR
+ // p = Math.max(m, p - d);
  numOfGames++;
  }