Leetcode 906. Super Palindromes

Count how many numbers in [left, right] are palindromes that are perfect squares whose integer square roots are also palindromes. Because right ≤ 10^18, the intended approach is to generate all palindromic roots up to sqrt(right) (odd/even lengths), square them, and check whether the square is a palindrome within the range.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 906. Super Palindromes

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact