solution: Project Euler Problem 13 (TheAlgorithms#1173)

* Included Project Euler 13 solution * Fix review comments * Fix style * fix for code review * fix the review * Fix Style Co-authored-by: Matheus Muriel <[email protected]>

Author: MatheusMuriel

Project-Euler/Problem013.js

@@ -1,22 +1,27 @@
 /**
- * Problem 13 - Large Sum
- *
- * @see{@link https://projecteuler.net/problem=13}
- *
- * Work out the first ten digits of the sum of the given one-hundred 50-digit numbers.
- */
+ * Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.
+*/
 
-/**
- * calculates the sum and returns first 10 digits.
- * @param{String} nums
- * @returns{Number}
- */
+exportfunctionlargeSum(bignum){
+constnums=[]
+for(leti=0;i<bignum.length;i+=50){
+nums.push(bignum.slice(i,i+50))
+}
+
+letpos=nums[0].length
+letret=''
+letnum=0
+
+while(pos--){
+for(leti=nums.length;i--;){
+num+=+nums[i].charAt(pos)
+}
+ret=num%10+ret
+num=num/10|0
+}
 
-exportconstlargeSum=(nums)=>{
-constarr=nums.split('\n')// convert to array of strings
-letsum=0n
-for(constitemofarr){
-sum+=BigInt(item)
-}// calculate the sum
-returnparseInt(sum.toString().substring(0,10))// convert the sum to a string and get the first 10 digits
+if(num>0){
+ret=num+ret
+}
+returnret.slice(0,10)
 }