Simple Fun #136: Missing Values

Simple Fun #136: Missing ValuesCodewars

Approach

Solve the problem

• count values

• sort value

• Find the value that appears twice.

• Find the value that appears once.

Time complexity

• count values = n

• sort value = n log n

• Find the value that appears twice. = n

• Find the value that appears once. = n

O = (4n log n)

Solution

JavaScript

// Simple Fun #136: Missing Values
// https://www.codewars.com/kata/58a66c208b88b2de660000c3

const missingValues = (arr) => {
  const set = arr.reduce((acc, cur) => {
    acc[cur] = (acc[cur] || 0) + 1;
    return acc;
  }, {});
  const sortedValue = Object.entries(set)
    .map((v) => [v[1], Number(v[0])])
    .sort((a, b) => a[0] - b[0]);
  
  return sortedValue[sortedValue.findIndex((v) => v[0] === 2)][1]
    * (sortedValue[sortedValue.findIndex((v) => v[0] === 1)][1] ** 2);
};