Neon Number in a Range Using JavaScript built-in methods
It generates an array of numbers within the given range using Array.from(), filters out the Neon numbers using the filter() method, and returns the resulting array.
Example: The below code example Uses the Array.from(), reduce() and filter() Method to find a Neon number in a Range in JavaScript.
Javascript
function sumOfDigits(number) { return number .toString() .split("") .reduce((acc, digit) => acc + parseInt(digit), 0);}function isNeon(number) { return sumOfDigits(number * number) === number;}function findNeonInRange(start, end) { return Array .from ( { length: end - start + 1 }, (_, index) => index + start, ).filter((num) => isNeon(num));}console.log(findNeonInRange(1, 100)); |
Output
[ 1, 9 ]
JavaScript Program to Find Neon Number in a Range
A Neon number is a number where the sum of digits of the square of the number is equal to the number itself. For example, 9 is a Neon number because 9^2 = 81 and the sum of digits of 81 is 8 + 1 = 9, which is the number itself. We want to find all the Neon numbers within a given range.
Below are the approaches to find Neon Numbers in a Range:
Table of Content
- Using Iteration
- Using recursion
- Using JavaScript built-in methods
Contact Us