String Algorithms Practice | Dataford Interview Questions

Find a palindrome series.

Given a non-negative integer n, return all positive integers from 1 through n whose decimal representations read the same forward and backward. Implement def find_palindrome_series(n):, returning a list of integers in ascending order. Return an empty list when n is 0.

Constraints

0 <= n <= 1000
Return positive palindrome numbers only
The result must be in ascending order

Function Signature

def find_palindrome_series(n):

Your question is String Algorithms Practice. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Find a palindrome series.

Constraints

0 <= n <= 1000
Return positive palindrome numbers only
The result must be in ascending order

Function Signature

def find_palindrome_series(n):

Your question is String Algorithms Practice. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.