1083 – Palindrome Numbers This program addresses an interesting mathematical problem: Calculating how many times a number needs to undergo the “reverse and add” operation to become a palindrome (a number that reads the same forwards and backwards, such as 121). How does the program work? First, the user inputs a number (for example, 57). … Read more
Today's algorithm problem is to solve the "Longest Palindromic Substring" problem using C language. Below are my algorithm ideas and implementation. Let's take a look. Algorithm Problem Given a string, find the longest palindromic substring within it. Algorithm Idea We will use the center expansion algorithm to solve the longest palindromic substring problem. The idea … Read more
Today’s algorithm problem is to solve the "Palindrome Number" algorithm using C language. Here is my thought process and implementation, let’s take a look. Algorithm Problem Given an integer, determine if it is a palindrome number. A palindrome number is an integer that reads the same forwards and backwards. Algorithm Idea We will use a … Read more
📌 Problem Description Please enter an integer x and determine whether it is a palindrome (i.e., it reads the same forwards and backwards). Requirements： Do not use string conversion Handle negative numbers (e.g., -121 is not a palindrome) Advanced: Avoid reversing the entire number to optimize time complexity Example: Input: 121 → Output: is a … Read more