Palindromic Numbers

Practice

3.4 (61 votes)

Ad Hoc

Algorithms

Approved

Basic programming

Easy

Open

Problem

75% Success 15784 Attempts 20 Points 2s Time Limit 256MB Memory 1024 KB Max Code

Given A and B, count the numbers N such that A \leq N \leq B and N is a palindrome. Examples: Palindromes: 121, 11 , 11411 Not Palindromes: 122, 10 Input: First line contains T, the number of testcases. Each testcase consists of two integers A and B in one line. Output: For each testcase, print the required answer in one line. Constraints: 1 \leq T \leq 10 0 \leq A \leq B \leq 10 5

You need to be logged in to access the code editor

Please wait while we load the editor

Results

Custom Input

Run your code to see the output

Submissions

Please login to view your submissions