longest-increasing-subsequence.js

function subLength(nbs) {
  if (nbs.length === 0) {
    return 0
  }

  let highestCounter = 1
  let counter = 1

  for (let i = 1; i < nbs.length; i++) {
    if (nbs[i] > nbs[i - 1]) {
      counter += 1
      if (counter > highestCounter) {
        highestCounter = counter
      }
    } else {
      counter = 1
    }
  }

  return highestCounter
}

console.log(subLength([13, 35, 1, 5, 40, 86])) // 4
console.log(subLength([0, 1, 2, 3, 13, 35, 1, 5, 40, 86])) // 6
console.log(subLength([0, 0, -1, 2, 10, 5])) // 3
console.log(subLength([])) // 0