Course
Introduction
Print an Integer (Entered by the User)Add Two IntegersMultiply two Floating Point NumbersFind ASCII value of a characterCompute Quotient and RemainderSwap Two NumbersCheck Whether a Number is Even or OddFind the Frequency of Character in a StringRemove All Whitespaces from a StringRound a Number to n Decimal PlacesDecision Making and Loop
Check Whether an Alphabet is Vowel or ConsonantFind the Largest Among Three NumbersFind all Roots of a Quadratic EquationCheck Leap YearCheck Whether a Number is Positive or NegativeCheck Whether a Character is Alphabet or NotCalculate the Sum of Natural NumbersFind Factorial of a NumberGenerate Multiplication TableDisplay Fibonacci SeriesFind GCD of two NumbersFind LCM of two NumbersDisplay Characters from A to Z using loopCount Number of Digits in an IntegerReverse a NumberCalculate the Power of a NumberCheck Whether a Number is Palindrome or NotCheck Whether a Number is Prime or NotDisplay Prime Numbers Between Two IntervalsCheck Armstrong NumberDisplay Armstrong Number Between Two IntervalsDisplay Factors of a NumberMake a Simple Calculator Using switch...caseCount the Number of Vowels and Consonants in a SentenceSort Elements in Lexicographical Order (Dictionary Order)Create Pyramid and PatternFunctions
Display Prime Numbers Between Intervals Using FunctionDisplay Armstrong Numbers Between Intervals Using FunctionCheck Whether a Number can be Expressed as Sum of Two Prime NumbersFind the Sum of Natural Numbers using RecursionFind Factorial of a Number Using RecursionFind G.C.D Using RecursionConvert Binary Number to Decimal and vice-versaConvert Octal Number to Decimal and vice-versaConvert Binary Number to Octal and vice-versaReverse a Sentence Using Recursioncalculate the power using recursionArrays
Calculate Average Using ArraysFind Largest Element in an ArrayCalculate Standard DeviationAdd Two Matrix Using Multi-dimensional ArraysMultiply to Matrix Using Multi-dimensional ArraysMultiply two Matrices by Passing Matrix to a FunctionFind Transpose of a MatrixPrint an ArrayConcatenate Two ArraysConvert Character to String and Vice-VersaCheck if An Array Contains a Given ValueCollections
Join Two ListsConvert List (ArrayList) to Array and Vice-VersaConvert Map (HashMap) to ListConvert Array to Set (HashSet) and Vice-VersaSort a Map By ValuesObject and Class
Add Two Complex Numbers by Passing Class to a FunctionCalculate Difference Between Two Time PeriodsAdvanced
Convert String to DateGet Current Date/TImeConvert Milliseconds to Minutes and SecondsAdd Two DatesGet Current Working DirectoryConvert Byte Array to HexadecimalCreate String from Contents of a FileAppend Text to an Existing FileConvert a Stack Trace to a StringConvert File to byte array and Vice-VersaConvert InputStream to StringConvert OutputStream to StringLookup enum by String valueCompare StringsSort ArrayList of Custom Objects By PropertyCheck if a String is NumericKotlin Program to Check Whether a Number is Palindrome or Not
Example: Program to Check Palindrome
fun main(args: Array<String>) {
var num = 121
var reversedInteger = 0
var remainder: Int
val originalInteger: Int
originalInteger = num
// reversed integer is stored in variable
while (num != 0) {
remainder = num % 10
reversedInteger = reversedInteger * 10 + remainder
num /= 10
}
// palindrome if orignalInteger and reversedInteger are equal
if (originalInteger == reversedInteger)
println("$originalInteger is a palindrome.")
else
println("$originalInteger is not a palindrome.")
}
When you run the program, the output will be:
121 is a palindrome.
Note: You can change the value of num to say 11221, and when you run the program, the output will be:
11221 is not a palindrome.
Here’s equivalent Java code: Java Program to Check Palindrome Number
In this program,
- First, given number (num)'s value is stored in another integer variable,
originalInteger
. This is because, we need to compare the values of reversed number and original number at the end. - Then, a while loop is used to loop through num until it is equal to 0.
- On each iteration, the last digit of num is stored in remainder.
- Then, remainder is added to reversedInteger such that it is added to the next place value (multiplication by 10).
- Then, the last digit is removed from num after division by 10.
- Finally, reversedInteger and originalInteger are compared. If equal, it is a palindrome number. If not, it isn’t.
Here are the execution steps that takes place:
Palindrome execution steps
num | num != 0 | remainder | reversedInteger |
---|---|---|---|
121 | true | 1 | 0 * 10 + 1 = 1 |
12 | true | 2 | 1 * 10 + 2 = 12 |
1 | true | 1 | 12 * 10 + 1 = 121 |
0 | false | - | 121 |