Question

write the program with the language NODEJS need help Programming challenge, screenshot your work and output.  

Description

A positive integer is a palindrome if its decimal representation (without leading zeros, is a palindromic string (a string that reads the same forwards and backwards). For example, the number 5, 77, 363, 4884, 11111, 12121 and 349943 are palindromes

A range of integers is interesting if it contains an even number of palindromes. The range [L, R], with L <= R, is defined as the sequence of integers from L to R (inclusive): (L, L+1, L+2,.., R-1, R). L and R are the range’s first and last numbers.

The range [L1,R1] is subrange of [L,R] if L <= L1 <= R1 <= R. Your job is to determine how many interesting subrane of [L,R] there are

Input

Your program should read lines of text from standard input. Each line will contain two positive integers, L and R (in that Order), separated by space.

Output

For each line of input, print out the number of interesting subranges of [L,R]

Code given:

process.stdin.resume();

process.stdin.setEncoding('utf8');

var stdin = ' ';

process.stdin.on('data', function (chunk) {

  stdin += chunk;

}).on('end', function() {

  var lines = stdin.trim().split('\n');

  for(var i=0; i

      process.stdout.write(lines[i]);

  }

});

Answer 1

Here is one way to do it: (Copyable code is provided at the end)

Driver Function:

Main function: This Function counts the number of palindromes

Palindrome checker Function : This Function checks whether a number is palindrome or not.

Input: First line for the number of inputs and the second line for the values L and R.

Output:

Copyable code:

function main(chunk) {
var input = chunk.trim().split(' ');
   for (var i = 1; i < input.length; i++) {
       var splitchunk = input[i].split(" ");
       var begin = parseInt(splitchunk[0]);
       var end = parseInt(splitchunk[1]);
       var count = 0;
       for (var j = begin; j <= end; j++) {
           if (isPalindrome(j.toString())) {
               count++;
           }
       }
       console.log(count);
   }
}

function isPalindrome(chunk) {
   var midIndex = Math.floor(chunk.length / 2);
   var len = chunk.length;
   var isPalindrome = true;
for (var i=0 ; i <= midIndex ; i++) {
if (chunk[i] != chunk[len-(i+1)]) {
           isPalindrome = false;
           break;
       }
}
   return isPalindrome;
}


process.stdin.resume();
process.stdin.setEncoding("utf-8");
var stdin = "";

process.stdin.on("data", function (chunk) {
stdin += chunk;
});

process.stdin.on("end", function () {
main(stdin);
});