Kata

https://www.codewars.com/kumite/6309f130f5800d002480c5e9?sel=6309f130f5800d002480c5e9 Typescript version

One loop timeout... How to even solve it without loop

Excellent Kata!

Same kata as this one: https://www.codewars.com/kata/untangle-list-deletion-slash-insertion/ except that that kata is currently in Python only.

I love this kata. Also I would love to read some feedback on my code. How fast and readable it is?

function solution(array) {
  let missing = 0, duplicate = 0;
  const lastNumber = array.length;
  const form = {};
  
  for (let i=1; i <= lastNumber; i++) form[i] = 1; 
  
  for (let num of array) form[num]--; 
  
  for (let key in form) {
    if (form[key] === 1) missing = +key;
    if (form[key] === -1) duplicate = +key; 
    if (missing && duplicate) break; 
  } 
  
  return [missing,duplicate];
}

Good Kata!

You mean, do not sort with a built-in function :)

Harder as I first thought!

The official solution does not work for:

Test.assertSimilar(solution([1,2,3,3,4,5]), [6,4]);