English beggars

English beggarsCodewars

Approach

Solve the problem

1. iterate 0 to n ( i )

   1. (inside process-1) Start the first index with i and increment the index by n until the index equals values.length.

   2. while iterate process-1-1, sum each index value

   3. when finish process 1-1 add sum value to the result stack

2. return result;

Solution

JavaScript

const beggars = (values, n) => {
  const result = [];
  let sum = 0;
  
  for (let i = 0; i < n; i += 1) {
    sum = 0;
    
    for (let j = i; j < values.length; j += n) {
      sum += values[j];
    }
    
    result.push(sum);
  }
  
  return result;
};