Difference between a number and it's reverse

PKJ

 Coding Problem Keys 

 Difference between a number and it's reverse 

 Problem Statement 

The number N is passed as input. The program must print the difference between the number N and it's reverse R.

 Boundary Condition(S) 

10 <= N <= 9999999

 Input Format 

The first line denotes the value of N.

 Output Format 

The first line contains the value of difference of N and R.

 Example Input/Output 1 

 Input 

42

 Output 

18

 Explanation 

The output is 42 - 24 = 18.

 Example Input/Output 2 

 Input 

555

 Output 

0

 Explanation 

The output is 555 - 555 = 0.

 Example Input/Output 3 

 Input 

125

 Output 

-396

 Explanation 

The output is 125 - 521 = -396.

 Note: Max Execution Time Limit: 5000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

n=input().strip()
print(int(n)-int(n[::-1]))

# Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Unique Characters

PKJ
 Unique Characters   Problem Statement:  The program must accept a string  S  as the input. The program must find the unique characters present in the string (remove duplicates) and print them in the order of their occurrence in the string S. Note: At least one unique character will be present in the string S. Boundary Condition(s): 1 <= Length of S <= 100 Input Format: The first line contains the string S. Output Format: The first line contains the unique characters in S (in the order of their occurrence in S).  Example Input/Output 1:   Input:  Ethernet112  Output:  Ehrn2 Explanation: The unique characters in the string "Ethernet112" are E, h, r, n and 2. So they are printed in the order of their occurrence in the string "Ethernet112". Hence the output is Ehrn2. Example Input/Output 2: Input: lollipop Output: i  Note: Max Execution Time Limit: 2000 millisecs   Solution:   Programming Language: C...
Click to Continue...

Reverse Array

PKJ
 Coding Problem Keys   Reverse Array   Problem Statement  The Program must accept N integers as the input. The program must print all the N integers in reverse order as the output.  Boundary Condition(s)  1 <= N <= 100 1 <= Each integer value <=10^7  Input Format  The First line contains the value of N. The Second line contains the N integers separated by space(s).  Output Format  The First line contains the N integers in reverse order separated by a space.  Example Input/Output 1   Input  5 2 4 7 9 10  Output  10 9 7 4 2  Explanation  The five integers are printed in reverse order.  Example Input/Output 2   Input  8 78 45 89 56 12 67 78 10  Output  10 78 67 12 56 89 45 78  Note:  Max Execution Time Limit: 4000 millisecs   Solution   Programming Language: C Language  #include <stdio.h> #include <stdlib....
Click to Continue...

Largest Possible N - Divisible by 4

PKJ
 Coding Problem Keys   Largest Possible N - Divisible by 4   Problem Statement  The program must accept an integer N as the input. The program must print the largest possible integer divisible by 4 from the digits of N. If it is not possible to form such an integer, the program must print -1 as the output. Note: The largest possible integer divisible by 4 has no leading zeros.  Boundary Condition(S)  2 <= N <= 10 ⁸  Input Format  The first line contains N .  Output Format  The first line contains the largest possible integer divisible by 4 from the digits of N or -1.  Example Input/Output 1   Input  102  Output  120  Explanation  Here the largest possible integer divisible by 4 from the digits of 102 is 120 . Hence the output is 120.  Example Input/Output 2   Input  1345  Output  -1  Note: Max Execution Time Limit: 500 millisecs  ...
Click to Continue...

Vowels Count

PKJ
 Coding Problem Keys   Vowels Count   Problem Statement  The program must accept a string S with space as the input. The program must print the number of vowels in S as the output.  Boundary Condition(S)  1 <= Length of String <=1000  Input Format  The first line contains string.  Output Format  The first line contains the count of vowels in string.  Example Input/Output 1   Input  daEmon  Output  3  Example Input/Output 2   Input  hello  Output  2  Example Input/Output 3   Input  editable  Output  4  Note: Max Execution Time Limit: 4000 millisecs   Solution  ...
Click to Continue...

Function samePositionBitCount - CTS Pattern

PKJ
 Coding Problem Keys   CTS Pattern   Function samePositionBitCount   Problem Statement  You are required to fix all logical errors in the given code. You can click on run anytime to check the compilation/execution status of the program. You can use printf to debug your code. The submitted code should be logically/syntactically correct and pass all test cases. Do not write the main() function as it is not required. Code Approach:  For this question, you will need to correct the given implementation. We do not expect you to modify the approach or incorporate any additional library methods. The function samePositionBitCount (int N1, int N2) accepts two integers N1 and N2 as the input. The function is supposed to return the count of bits which are equal in both the integers at the same positions. The function compiles fine but fails to return the desired result due to logical errors. Your task is to fix the program so that it passes all test case...
Click to Continue...

Snakes and Ladders

PKJ
 Coding Problem Keys   Snakes and Ladders   Problem Statement  In an R*C matrix, a snake is represented using the letter 'S' and the ladder is represented using the letter 'L'. A kid is playing the Snakes and Ladders game with this matrix and a die which can show from 1 to 6. The game always starts with the pawn in the lower left most cell in the matrix and the aim is to reach or cross the top left most cell by casting the die as many times as required. Based on the number cast in the die, if the pawn lands up in a cell containing a snake, the pawn must move to the immediate lower row (if it is not in the lowermost row) in the same column. Based on the number cast in the die, if the pawn lands up in a cell containing a ladder, the pawn must move to the immediate upper row in the same column (It may so happen that the pawn is already in the top most row and if it encounters a ladder it is consider...
Click to Continue...