# Introduction In this challenge, we will implement a function to calculate the number of palindromic numbers from 1 to a given number n. A palindromic number is a number that reads the same forwards and backwards. We need to write a Java class with a method that takes an integer n as input and returns the count of palindromic numbers from 1 to n. The solution should not use any built-in methods for reversing strings or collections.
Click the virtual machine below to start practicing