Palindromic Numbers Finder

Given an integer 'N', your task is to identify all palindromic numbers from 1 to 'N'. These are numbers that read the same way forwards and backwards.

Input:

The first line provides a single integer 'T', indicating the number of test cases. Each test case contains a single integer 'N' located on a new line.

Output:

For each test case, print all palindromic numbers from 1 to 'N' in ascending order, separated by spaces. Print the results for each test case on a separate line.

Example:

Input:

1
12

Output:

1 2 3 4 5 6 7 8 9 11

Explanation:

Every single-digit number qualifies as a palindrome, and additionally, the number 11 also qualifies as a palindrome.

Constraints:

1

Question

Palindromic Numbers Finder

Given an integer 'N', your task is to identify all palindromic numbers from 1 to 'N'. These are numbers that read the same way forwards and backwards.

Input:

The first line provides a single integer 'T', indicating the number of test cases.

Each test case contains a single integer 'N' located on a new line.

Output:

For each test case, print all palindromic numbers from 1 to 'N' in ascending order, separated by spaces.
Print the results for each test case on a separate line.

Example:

Input:

1
12

Output:

1 2 3 4 5 6 7 8 9 11

Explanation:

Every single-digit number qualifies as a palindrome, and additionally, the number 11 also qualifies as a palindrome.

Constraints:

1 <= T <= 10
1 <= N <= 10^9
Time Limit: 1 second

Note:

Your solution should not include printing logic, focus on implementing the function logic only.

Accepted Answer

Implement a function to find all palindromic numbers from 1 to N.

Iterate from 1 to N and check if each number is a palindrome
Use string manipulation to check for palindromes
Consider edge cases like single-digit numbers and 11

Accepted Answer

def is_palindromic(num):
    return str(num) == str(num)[::-1]

def find_palindromes(N):
    # Iterate through all numbers from 1 to N and check if they are palindromic
    palindromic_numbers = []
    for num in range(1, N+1):
        if is_palindromic(num):
            palindromic_numbers.append(num)
    
    return palindromic_numbers

N = int(input("Enter the value of N: "))
palindromic_numbers = find_palindromes(N)
print(f"Palindromic numbers from 1 to {N}:", palindromic_numbers)

Accepted Answer

211

Accepted Answer

Asked in TCS