Longest increasing subsequence

the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. from wiki

three solutions

solution from wiki

source

using patience sorting

source

dumb solution

findAllSubseq(arr)
filterNonIncreasing(arrs)
findLongestSub(arrs)

check folder dumb_solution for more details

install

npm install

test

npm run test