Best Travel

best-travel.js

// Work in Progress

function chooseBestSum(t, k, ls) {
if(ls.length <= 1){return null}
else {
return Array
        .apply(0, { length: Math.pow(k+1, ls.length) })
        .map(Number.call, Number)
        .map(a => a
              .toString(ls.length)
              .split('')
              .sort()
              .filter((a, b, c) => c.indexOf(a) == b)
              .join(''))
        .filter((a, b, c) => a.length == k && c.indexOf(a) == b)
        .map(x => x.split('').map(y => ls[+y]))
        .map(x => x.reduce((pv,cv) => pv+cv, 0))
        .filter(x => x <= t)
        .reduce((a,b) => Math.max(a,b))
}
}