Check whether a string or integer reads the same forwards and backwards, with case and whitespace sanitization.
When this program is compiled and executed, the terminal outputs:
"Racecar" -> Palindrome: True "A man, a plan, a canal: Panama" -> Palindrome: True "ZenCompiler" -> Palindrome: False "12321" -> Palindrome: True Integer tests: 121 -> Palindrome: True -121 -> Palindrome: False 10 -> Palindrome: False 1221 -> Palindrome: True
Practice in our high-performance cloud container IDE with multi-file support, interactive terminal STDIN, real-time memory visualizer, and structured lessons.
A prime number is a positive integer greater than 1 that has no positive divisors other than 1 and itself. This example demonstrates an optimized approach checking factors up to √n.
The Fibonacci sequence is a series where each number is the sum of the two preceding ones, starting from 0 and 1. Here we implement iterative generation and generator streaming.
Calculate the factorial of a non-negative integer (n!) using both recursive and iterative paradigms, handling base cases safely.