Digit sum upto a number of digits of a number in JavaScript

We are required to write a JavaScript function that takes in two numbers, let’s say m and n as arguments.

n will always be smaller than or equal to the number of digits present in m. The function should calculate and return the sum of first n digits of m.

For example −

If the input numbers are −

const m = 5465767;
const n = 4;

Then the output should be −

const output = 20;

because 5 + 4 + 6 + 5 = 20

Example

Following is the code −

const m = 5465767;
const n = 4;
const digitSumUpto = (m, n) => {
   if(n > String(m).length){
      return 0;
   };
   let sum = 0;
   for(let i = 0; i < n; i++){
      const el = +String(m)[i];
      sum += el;
   };
   return sum;
};
console.log(digitSumUpto(m, n));

Output

Following is the console output −

20

AmitDiwan

Published on 19-Jan-2021 06:15:02

• Related Questions & Answers
• Reduce sum of digits recursively down to a one-digit number JavaScript
• Prime digits sum of a number in JavaScript
• Finding sum of digits of a number until sum becomes single digit in C++
• Product sum difference of digits of a number in JavaScript
• C++ program to find sum of digits of a number until sum becomes single digit
• Recursive sum all the digits of a number JavaScript
• Check whether sum of digit of a number is Palindrome - JavaScript
• Destructively Sum all the digits of a number in JavaScript
• Greatest digit of a number in JavaScript
• Summing up all the digits of a number until the sum is one digit in JavaScript
• Difference between product and sum of digits of a number in JavaScript
• Square every digit of a number - JavaScript
• Returning number of digits in factorial of a number in JavaScript
• Separating digits of a number in JavaScript
• Checking whether the sum of digits of a number forms a Palindrome Number or not in JavaScript