two function added

Author: Nazmulstc

Note.txt Problem.txtNote.txt renamed to Problem.txt

@@ -13,44 +13,45 @@
 #13: Create a function that will convert from Fahrenheit to Celsius
 #14: Print in Console the first 10 Fibonacci numbers without recursion
 #15: Create a function that will find the nth Fibonacci number using recursion
-#16: Create a function that will return a Boolean specifying if a number is prime
-#17: Calculate the sum of digits of a positive integer number
-#18: Print in Console the first 100 prime numbers
-#19: Create a function that will return in an array the first "nPrimes" prime numbers greater than a particular number "startAt"
-#20: Rotate an array to the left 1 position
-#21: Rotate an array to the right 1 position
-#22: Reverse an array
-#23: Reverse a string
-#24: Create a function that will merge two arrays and return the result as a new array
-#25: Create a function that will receive two arrays of numbers as arguments and return an array composed of all the numbers that are either in the first array or second array but not in both
-#26: Create a function that will receive two arrays and will return an array with elements that are in the first array but not in the second
-#27: Create a function that will receive an array of numbers as argument and will return a new array with distinct elements
-#28: Calculate the sum of first 100 prime numbers
-#29: Print in Console the distance between the first 100 prime numbers
-#30-a: Create a function that will add two positive numbers of indefinite size. The numbers are received as strings and the result should be also provided as string.
-#31a. Create a function that will return the number of words in a text
-#32. Create a function that will capitalize the first letter of each word in a text
-#33. Calculate the sum of numbers received in a comma delimited string
-#34. Create a function that will return an array with words inside a text
-#35. Create a function to convert a CSV text to a “bi-dimensional” array
-#36. Create a function that converts a string to an array of characters
-#37. Create a function that will convert a string in an array containing the ASCII codes of each character
-#38. Create a function that will convert an array containing ASCII codes in a string
-#39. Implement the Caesar cypher
-#40. Implement the bubble sort algorithm for an array of numbers
-#41. Create a function to calculate the distance between two points defined by their x, y coordinates
-#42. Create a function that will return a Boolean value indicating if two circles defined by center coordinates and radius are intersecting
-#43. Create a function that will receive a bi-dimensional array as argument and a number and will extract as a unidimensional array the column specified by the number
-#44. Create a function that will convert a string containing a binary number into a number
-#45. Create a function to calculate the sum of all the numbers in a jagged array (array contains numbers or other arrays of numbers on an unlimited number of levels)
-#46-a. Find the maximum number in a jagged array of numbers or array of numbers
-#47. Deep copy a jagged array with numbers or other arrays in a new array
-#48. Create a function to return the longest word(s) in a string
-#49. Shuffle an array of strings
-#50. Create a function that will receive n as argument and return an array of n unique random numbers from 1 to n.
-#51. Find the frequency of characters inside a string. Return the result as an array of objects. Each object has 2 fields: character and number of occurrences.
-#52. Calculate Fibonacci(500) with high precision (all decimals)
-#53. Calculate 70! with high precision (all digits)
+#16: Check Leap Year Using if...else?
+#17: Create a function that accepts an array and returns the last item in the array.
+#18: Calculate the sum of digits of a positive integer number
+#19: Print in Console the first 100 prime numbers
+#20: Create a function that will return in an array the first "nPrimes" prime numbers greater than a particular number "startAt"
+#21: Rotate an array to the left 1 position
+#22: Rotate an array to the right 1 position
+#23: Reverse an array
+#24: Reverse a string
+#25: Create a function that will merge two arrays and return the result as a new array
+#26: Create a function that will receive two arrays of numbers as arguments and return an array composed of all the numbers that are either in the first array or second array but not in both
+#27: Create a function that will receive two arrays and will return an array with elements that are in the first array but not in the second
+#28: Create a function that will receive an array of numbers as argument and will return a new array with distinct elements
+#29: Calculate the sum of first 100 prime numbers
+#30: Print in Console the distance between the first 100 prime numbers
+#31-a: Create a function that will add two positive numbers of indefinite size. The numbers are received as strings and the result should be also provided as string.
+#32. Create a function that will return the number of words in a text
+#33. Create a function that will capitalize the first letter of each word in a text
+#34. Calculate the sum of numbers received in a comma delimited string
+#35. Create a function that will return an array with words inside a text
+#36. Create a function to convert a CSV text to a “bi-dimensional” array
+#37. Create a function that converts a string to an array of characters
+#38. Create a function that will convert a string in an array containing the ASCII codes of each character
+#39. Create a function that will convert an array containing ASCII codes in a string
+#40. Implement the Caesar cypher
+#41. Implement the bubble sort algorithm for an array of numbers
+#42. Create a function to calculate the distance between two points defined by their x, y coordinates
+#43. Create a function that will return a Boolean value indicating if two circles defined by center coordinates and radius are intersecting
+#44. Create a function that will receive a bi-dimensional array as argument and a number and will extract as a unidimensional array the column specified by the number
+#45. Create a function that will convert a string containing a binary number into a number
+#46. Create a function to calculate the sum of all the numbers in a jagged array (array contains numbers or other arrays of numbers on an unlimited number of levels)
+#47-a. Find the maximum number in a jagged array of numbers or array of numbers
+#48. Deep copy a jagged array with numbers or other arrays in a new array
+#49. Create a function to return the longest word(s) in a string
+#50. Shuffle an array of strings
+#51. Create a function that will receive n as argument and return an array of n unique random numbers from 1 to n.
+#52. Find the frequency of characters inside a string. Return the result as an array of objects. Each object has 2 fields: character and number of occurrences.
+#53. Calculate Fibonacci(500) with high precision (all decimals)
+#54. Calculate 70! with high precision (all digits)
 
 
 #01. Create a function that takes two numbers as arguments and return their sum.

README.md

@@ -198,3 +198,29 @@ function checkLeapYear(year) {
 console.log(checkLeapYear(2025));
 
 ```
+
+**#17: Create a function that accepts an array and returns the last item in the array?**
+
+```
+
+const arr = [50, 90, 80, 66, 85];
+const returnLastItem = (arr) => arr[arr.length - 1];
+console.log(returnLastItem(arr));
+
+```
+
+**#18: Calculate the sum of digits of a positive integer number?**
+
+```
+
+const sumOfDigits = (n) => {
+  const newArr = Array.from(String(n), Number);
+  let sumOfArr = 0;
+  for (let i = 0; i < newArr.length; i++) {
+    sumOfArr += newArr[i];
+  }
+  return sumOfArr;
+};
+console.log(sumOfDigits(45465));
+
+```

script.js

@@ -119,16 +119,18 @@ function checkLeapYear(year) {
 }
 console.log(checkLeapYear(2025));
 
-// #00: Print in Console the first 10 Fibonacci numbers without recursion
-var f0 = 0;
-// console.log(f0);
-var f1 = 1;
-// console.log(f1);
-
-for (var i = 2; i < 10; i++) {
-  var fi = f1 + f0;
-  // console.log(fi);
-
-  f0 = f1;
-  f1 = fi;
-}
+// #17: Create a function that accepts an array and returns the last item in the array?
+const arr = [50, 90, 80, 66, 85];
+const returnLastItem = (arr) => arr[arr.length - 1];
+console.log(returnLastItem(arr));
+
+// #18: Calculate the sum of digits of a positive integer number?
+const sumOfDigits = (n) => {
+  const newArr = Array.from(String(n), Number);
+  let sumOfArr = 0;
+  for (let i = 0; i < newArr.length; i++) {
+    sumOfArr += newArr[i];
+  }
+  return sumOfArr;
+};
+console.log(sumOfDigits(45465));