Hackerrank: Mark and Toys Solution

1function maximumToys(prices, k) {
2  prices.sort((a, b) => a - b)
3  let sum = 0
4  const prefixSums = prices.map(price => {
5    sum += price
6    return sum
7  })
8  let numberOfToyes
9  for (let i = 0; i < prefixSums.length; i++) {
10    if (prefixSums[i] > k) {
11      numberOfToyes = i
12      break
13    }
14  }
15  return numberOfToyes
16}