This is the solution to the Modified Kaprekar Numbers found in the implementation section of the algorithm domain in Hackerrank. A modified Kaprekar number is a positive whole number n with d digits, such that when we split its square into two pieces – a right hand piece r with d digits and a left hand piece l that contains the remaining d or d−1 digits, the sum of the pieces is equal to the original number (i.e. l + r = n).
for i in range(st,en+1):
print 'INVALID RANGE'
print ' '.join(s)
Got any problems feel free to comment them here !
Latest posts by Bikash Panda (see all)
- RPi GPIO Programming using Arduino Web IDE - August 12, 2018
- Arduino: String to Array Conversion based on delimiter - July 20, 2018
- OpenHAB2Installation on Ubuntu Server (16.04) - May 29, 2018