Palindrome Number in C, Java, and Python

Introduction

[{"selector":"#anim-e06c9eac-1c6b-4d2f-9e1f-0df5eb30a5e0","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-ed4419d9-3569-47de-9a27-dda489206f27","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-cf411880-e67c-4d49-9ce3-5eac902c04bb","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-54598b38-41ae-453c-a7f4-3254e2f21ea4","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-9223e8d3-a00f-4a85-a4f9-fd3bad274713 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

Problem Statement

[{"selector":"#anim-a2e54697-b019-4a7f-a0d5-b5d0029ca179","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-8f3a903f-9540-49f2-bb89-378c586156b4","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-774fba45-5008-442b-8bc9-eb4b9f6ddbde","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-aa239c65-c98a-49f1-ac1e-2fea868708a8","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-457fd5b4-0f57-4e28-8ebd-f4396aea06de [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(25%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

Input 1: 146541 Output: False Input 2: 1221 Output: True

[{"selector":"#anim-1a1caf3c-baa0-46d6-bd85-6febe69db600","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-659329d6-178d-4cf0-a11c-4ec718fdba80","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-0565c304-7a32-4e7d-b3c6-14d83fc75ef8 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-0174b905-53ef-48be-9e00-fc404206dafb","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-bef4929a-cf31-497d-baab-086f2f250a85","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

1. Take user's input. 2. Declare a variable reverseNum=0. 3. Now, make a while loop until the original number > 0.

[{"selector":"#anim-bced044d-d16a-44c3-b7d1-a477dd260f6c","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-c682eb39-93f8-4ba7-b668-338712a30295","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-6b5e004e-f64b-412f-ade0-cac9c57e535c [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-594b9a82-ec72-49ae-8ba7-890e0b6ccf25","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-5800fca7-9a94-4c69-9830-7f00773d5d92","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

4. In every loop, get last digit of number and add that digit at end of reverseNum and then divide original number by 10. reverseNum = reverseNum * 10 + (number % 10) 5. Lastly, check if original number = reverseNum.

[{"selector":"#anim-940440ab-5b5a-4508-8252-81d26168e8ab","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-a825eba7-3472-49fd-8342-91ff8bc3e4e4","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-76271d9e-f06b-4e4b-a586-ad89ce274d0a [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(25%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

How to implement this approach in different programming languages?

[{"selector":"#anim-4f2eb1ab-26a0-451b-84d6-80a7433b5ce1","keyframes":{"opacity":[0,1]},"delay":0,"duration":1000,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-f8202b02-7078-4dc0-8019-44e161175e74","keyframes":{"transform":["translate3d(0px, 158.52896%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":1000,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-c2862c39-277d-4095-82ab-d570a95023ca [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

Palindrome Number in C, Java, and Python

How to Determine?

Introduction

A palindrome is a word, phrase, number, or sequence of characters that reads the same both forward and backward when reversed. Eg: dad, 101, etc.

Problem Statement

Given a positive integer, the task is to determine whether the number is a palindrome or not.

Input 1: 146541 Output: False Input 2: 1221 Output: True

Examples:

1. Take user's input. 2. Declare a variable reverseNum=0. 3. Now, make a while loop until the original number > 0.

Algorithm to Check Palindrome Number

4. In every loop, get last digit of number and add that digit at end of reverseNum and then divide original number by 10. reverseNum = reverseNum * 10 + (number % 10) 5. Lastly, check if original number = reverseNum.

How to implement this approach in different programming languages?