Sum of first K even-length Palindrome numbers
Last Updated :
06 Apr, 2023
Given a integer k, find the sum of first k even-length palindrome numbers.
Even length here refers to the number of digits of a number is even.
Examples:
Input : k = 3
Output : 66
Explanation: 11 + 22 + 33 = 66 (Sum
of first three even-length palindrome
numbers)
Input : 10
Output : 1496
Explanation: 11+22+33+44+55+66+77+88+
99+1001 = 1496
A naive approach will be to check every even length number, if it is a palindrome number then we sum it up. We repeat the same process for first K even length palindrome numbers and sum them up to get the sum.
In this case complexity will go high as even length numbers are from 10-99 and then 1000-9999 and then so on…
10-99, 1000-9999, 100000-999999.. has 9, 90, 900 respectively palindrome numbers in them, so to check k numbers we have to check a lot of numbers which will not be efficient enough.
An efficient approach will be to observe a pattern for even length prime numbers.
11, 22, 33, 44, 55, 66, 77, 88, 99, 1001, 1111, 1221, 1331, 1441, 1551, 1661…
1st number is 11, 2nd is 22, third is 33, 16th is 16-rev(16) i.e., 1661.
So the Nth number will int(string(n)+rev(string(n)).
See here for conversion of integer to string and string to integer.
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
#include <boost/lexical_cast.hpp>
using namespace std;
int sum( int k)
{
int sum = 0;
for ( int i = 1; i <= k; i++) {
string num = to_string(i);
string revNum = num;
reverse(revNum.begin(), revNum.end());
string strnum = (num + revNum);
int number = boost::lexical_cast< int >(strnum);
sum += number;
}
return sum;
}
int main()
{
int k = 3;
cout << sum(k);
return 0;
}
|
Java
import java.util.*;
import java.lang.*;
public class GfG{
public static String reverseString(String str)
{
StringBuilder sb = new StringBuilder(str);
sb.reverse();
return sb.toString();
}
static int sum( int k)
{
int sum = 0 ;
for ( int i = 1 ; i <= k; i++) {
String num = Integer.toString(i);
String revNum = num;
revNum = reverseString(num);
String strnum = (num + revNum);
int number = Integer.parseInt(strnum);
sum += number;
}
return sum;
}
public static void main(String argc[])
{
int n = 3 ;
System.out.println(sum(n));
}
}
|
Python3
def summ(k):
sum = 0
for i in range ( 1 , k + 1 ):
num = str (i)
revNum = num
revNum = ''.join( reversed (revNum))
strnum = num + revNum
number = int (strnum)
sum + = number
return sum
if __name__ = = "__main__" :
k = 3
print (summ(k))
|
C#
using System;
class GfG
{
static int sum( int k)
{
int sum = 0;
for ( int i = 1; i <= k; i++)
{
String num = Convert.ToString(i);
String revNum = num;
revNum = reverse(num);
String strnum = (num + revNum);
int number = Convert.ToInt32(strnum);
sum += number;
}
return sum;
}
static String reverse(String input)
{
char [] temparray = input.ToCharArray();
int left, right = 0;
right = temparray.Length - 1;
for (left = 0; left < right; left++, right--)
{
char temp = temparray[left];
temparray[left] = temparray[right];
temparray[right] = temp;
}
return String.Join( "" ,temparray);
}
public static void Main(String []argc)
{
int n = 3;
Console.WriteLine(sum(n));
}
}
|
Javascript
<script>
function sum(k)
{
var sum = 0;
for ( var i = 1; i <= k; i++) {
var num = (i.toString());
var revNum = num;
revNum = revNum.split( '' ).reverse().join( '' );
var strnum = (num + revNum);
var number = parseInt(strnum);
sum += number;
}
return sum;
}
var k = 3;
document.write(sum(k));
</script>
|
Time Complexity: O(k*log10k), as we are using a loop to traverse k times and we are using the reverse() function in each traversal which will cost O(log10k) as the maximum size of the string we are reversing will be log10k.
Auxiliary Space: O(log10k), as we are using extra space for string of size log10k.
Another Approach:
1. Initialize a variable sum to 0 to keep track of the sum of the palindrome numbers.
2. Initialize a counter variable count to 0 to keep track of the number of palindrome numbers found so far.
3. Initialize a variable i to 1 to start iterating from the first positive integer.
4. Repeat the following steps until count reaches K:
a. Convert the integer i to a string and check if it is a palindrome. If it is, add it to sum and increment count.
b. Increment i to check the next positive integer.
Once count reaches K, sum will contain the sum of the first K even-length palindrome numbers.
C++
#include <bits/stdc++.h>
using namespace std;
#define MAX_DIGITS 20
bool is_palindrome( char *s) {
int length = strlen (s);
for ( int i = 0; i < length / 2; i++) {
if (s[i] != s[length - i - 1]) {
return false ;
}
}
return true ;
}
int main() {
int K = 5;
int sum = 0;
int count = 0;
int i = 1;
while (count < K) {
char s[MAX_DIGITS];
sprintf (s, "%d" , i);
if ( strlen (s) % 2 == 0 && is_palindrome(s)) {
sum += i;
count++;
}
i++;
}
cout<< "Sum of first " <<K<< " even-length palindrome numbers: " <<sum<<endl;
return 0;
}
|
C
#include <stdio.h>
#include <stdbool.h>
#include <string.h>
#define MAX_DIGITS 20
bool is_palindrome( char *s) {
int length = strlen (s);
for ( int i = 0; i < length / 2; i++) {
if (s[i] != s[length - i - 1]) {
return false ;
}
}
return true ;
}
int main() {
int K = 5;
int sum = 0;
int count = 0;
int i = 1;
while (count < K) {
char s[MAX_DIGITS];
sprintf (s, "%d" , i);
if ( strlen (s) % 2 == 0 && is_palindrome(s)) {
sum += i;
count++;
}
i++;
}
printf ( "Sum of first %d even-length palindrome numbers: %d\n" , K, sum);
return 0;
}
|
Python3
MAX_DIGITS = 20
def is_palindrome(s: str ) - > bool :
length = len (s)
for i in range (length / / 2 ):
if s[i] ! = s[length - i - 1 ]:
return False
return True
def main():
K = 5
sum = 0
count = 0
i = 1
while count < K:
s = str (i)
if len (s) % 2 = = 0 and is_palindrome(s):
sum + = i
count + = 1
i + = 1
print (f "Sum of first {K} even-length palindrome numbers: {sum}" )
if __name__ = = "__main__" :
main()
|
C#
using System;
class Gfg {
const int MAX_DIGITS = 20;
static bool is_palindrome( string s) {
int length = s.Length;
for ( int i = 0; i < length / 2; i++) {
if (s[i] != s[length - i - 1]) {
return false ;
}
}
return true ;
}
static void Main( string [] args) {
int K = 5;
int sum = 0;
int count = 0;
int i = 1;
while (count < K) {
string s = i.ToString();
if (s.Length % 2 == 0 && is_palindrome(s)) {
sum += i;
count++;
}
i++;
}
Console.WriteLine( "Sum of first {0} even-length palindrome numbers: {1}" , K, sum);
}
}
|
Javascript
const MAX_DIGITS = 20;
function is_palindrome(s) {
let length = s.length;
for (let i = 0; i < Math.floor(length / 2); i++) {
if (s[i] !== s[length - i - 1]) {
return false ;
}
}
return true ;
}
let K = 5;
let sum = 0;
let count = 0;
let i = 1;
while (count < K) {
let s = i.toString();
if (s.length % 2 === 0 && is_palindrome(s)) {
sum += i;
count += 1;
}
i += 1;
}
console.log(`Sum of first ${K} even-length palindrome numbers: ${sum}`);
|
Java
import java.util.*;
public class Main {
public static boolean isPalindrome(String s) {
int length = s.length();
for ( int i = 0 ; i < length / 2 ; i++) {
if (s.charAt(i) != s.charAt(length - i - 1 )) {
return false ;
}
}
return true ;
}
public static void main(String[] args) {
int K = 5 ;
int sum = 0 ;
int count = 0 ;
int i = 1 ;
while (count < K) {
String s = Integer.toString(i);
if (s.length() % 2 == 0 && isPalindrome(s)) {
sum += i;
count++;
}
i++;
}
System.out.println( "Sum of first " + K + " even-length palindrome numbers: " + sum);
}
}
|
Output
Sum of first 5 even-length palindrome numbers: 165
Time Complexity: O(K*N) where K is the number of even-length palindrome numbers to find and N is the maximum number of digits in any of the palindrome numbers.
Auxiliary Space: O(N) since we only need to store the string representation of each number.
Share your thoughts in the comments
Please Login to comment...