Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2396. Strictly Palindromic Number
Check whether an integer n (4 ≤ n ≤ 10^5) is "strictly palindromic" — i.e., its representation in every base b from 2 to n−2 is a palindrome — and return true only if all those base-conversions are palindromic. The core task is performing base conversion and palindrome checks across the range of bases.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.