Leetcode Problem 2396. Strictly Palindromic Number

2396. Strictly Palindromic Number

Leetcode Solutions

The Impossibility of Strictly Palindromic Numbers

  1. Define a function isStrictlyPalindromic that takes an integer n as input.
  2. Without any further computation, return false.
UML Thumbnail

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...