Count all possible N digit numbers that satisfy the given condition
Given an integer N, the task is to count all possible N digit numbers such that A + reverse(A) = 10N – 1 where A is an N digit number and reverse(A) is reverse of A. A shouldn’t have any leading 0s.
Input: N = 2
All possible 2 digit numbers are 90, 81, 72, 63, 54, 45, 36, 27 and 18.
Input: N = 4
Approach: First we have to conclude that if N is odd then there is no number which will satisfy the given condition, let’s prove it for N = 3,
so and .
which is impossible as it is a floating point number.
Now Find answer for when N is even. For example, N=4,
and now if x + y = 9 then the number of pairs which satisfy this condition are 10.
(0, 9), (1, 8), (2, 7), (3, 6), (4, 5), (5, 4), (6, 3), (7, 2), (8, 1), (9, 0)
Now, 1st and Nth digit cannot have the pair (0, 9) as there shouldn’t be any leading 0s in A but for all the remaining N/2-1 pairs there can be 10 pairs.
So the answer is , As N is large so we will print 9 followed by N/2-1 number of 0s.
Below is the implementation of the above approach:
Time Complexity: O(N)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.