Help me to write a C program which can generate list of numbers which are palindrome in decimal and octal notion. You can take some max as a limit find out all numbers which satisfy the given property between 1 to n.
Convert the given string into palindrome with minimum number of appends(at end of the given string). O(n) algorithm will be appreciated ??
Input :=> Malayal Output :=> Malayalam
For example: It returns ‘b’ when the input is “abaccdeff”.
40 /\ 20 60 /\ \ 10 30 80 / /\ 25 70 90 \ 75 longest path 25 30 20 40 60 80 70 75 Answer 25 ----> 75
eg: array = "amber","gaura","sahil","mabre","rauag","halis", "bamre"} then no. of anagram groups = 3. "amber" ,"mabre" ,"bamre" form one group.
