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.