Palindrome count
CodeChefOpen on judge ↗
You are given two integer $N$ and $M$. You have to tell sum of digit of all palindrome number between $N$ and $M$ (Inclusive) You are given $X$ query of that type. ###Input: - First line of input is number of query $X$ $( 1 \le X \le 10^5)$. - Next $X$ line of input is containing Two integer $N$ and $M$. $(1 \le N \le M \le 10^{18}) $ ###Output: - For Each testcase Print number of
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start