Sort N Strings - Descending Order

PKJ

 Coding Problem Keys 

 Sort N Strings - Descending Order 

 Problem Statement 

N strings are passed as input. The program must sort them in the descending order.

 Boundary Condition(s) 

2 <= N <= 15
Length of a string is between 2 and 100.

 Input Format 

The first line contains the value of N.
Next N lines contain the value of N string values.

 Output Format 

N lines containing the N string values sorted in descending order.

 Example Input/Output 1 

 Input 

6
Apple
banana
Boy
Zoo
Hat
heckle

 Output 

heckle
banana
Zoo
Hat
Boy
Apple

 Note: Max Execution Time Limit: 5000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

n=int(input())
l=sorted([input().strip() for i in range(n)])[::-1]
for i in l:
    print(i)

# 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

Next Multiple of X after N

PKJ
 Coding Problem Keys    Next Multiple of X after N    Problem Statement  The program must accept two integers N and X as the input. The program must print the next multiple of X after N as the output.  Input Format  The first line contains N and X separated by a space.  Output Format  The first line contains the next multiple of X after N.  Boundary Condition(s)  1 <= N, X < 10 ⁷  Example Input/Output 1   Input  147 20   Output  160  Explanation  The next multiple of 20 after 147 is 160 . Hence the output is 160.  Example Input/Output 2   Input  20 10   Output  30  Max Execution Time Limit: 500 millisecs   Solution   Programming Language: Python 3 Language  # Published By PKJCODERS  ( Note:  Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 
Click to Continue...

Sum - Remove Last Occurring Zero

PKJ
 Coding Problem Keys   Sum - Remove Last Occurring Zero   Problem Statement  The program must accept  N  integers as the input. For each integer  X  among the N integers, the program must remove the last occurring 0 in X. Then the program must print the sum of those N modified integers as the output.  Boundary Condition(S)  1 <= N <= 100 1 <= Each Integer Value <= 10 ⁸  Input Format  The first line contains N . The second line contains N integers separated by a space.  Output Format  The first line contains the sum of those N modified integers.  Example Input/Output 1   Input  4 160 875 5000 20111  Output  3501  Explanation  After removing the last occurring 0 in 160 , the integer becomes 16 . The integer 875 has no zeros. So it remains same. After removing the last occurring 0 in 5000 , the integer becomes 500 . After removing the last occurring 0 in ...
Click to Continue...

Maximum LCM of Adjacent Pair

PKJ
 Coding Problem Keys   Maximum LCM of Adjacent Pair   Problem Statement  An array of N integers is passed as the input to the program. The program must print the maximum LCM value of two adjacent integers (among the N integers).  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 two integers separated by space.  Boundary Condition(s)  1 <= N <= 100000  Example Input/Output 1   Input  4 24 12 50 10   Output  300  Example Input/Output 2   Input  6 15 25 35 70 100 70  Output  700  Max Execution Time Limit: 3000 millisecs   Solution   Programming Language: Python 3 Language  def gcd (a,b): if a== 0 : return b return gcd(b%a,a) def lcm (a,b): return (a//gcd(a,b))*b n= int ( input ()) l= list ( map...
Click to Continue...

Four Integers

PKJ
 Coding Problem Keys   Four Integers   Problem Statement  Four integers are passed as the input to the program. Among them one of the integers X is a factor of another two numbers but not a factor of the third number. Finally the program must print the value of X.  Boundary Condition(s)  2 <= Each integer value <= 1000  Input Format  The first line contains four integers separated by a space.  Output Format  The first line contains X.  Example Input/Output 1   Input  10 30 6 42  Output  6  Explanation  6 is a factor of 30 and 42 but it is not a factor of 10.  Example Input/Output 2   Input  25 75 5 100  Output  25  Explanation  25 is a factor of 75 and 100 but it is not a factor of 5.  Note:  Max Execution Time Limit: 500 millisecs   Solution   Programming Language: Python 3 Language  a,b,c,d= sorted ( map ( ...
Click to Continue...

Array Frequency Equals Value

PKJ
 Coding Problem Keys   Array Frequency Equals Value   Problem Statement  The program must accept N integer values and print the values which are equal to the count of their occurrence (in ascending order). If there is no such value then the program must print -1.  Input Format  The first line contains the value of N. The second line contains the N integer values separated by a space.  Output Format  The first line contains the integer values separated by a space.  Boundary Condition(s)  1 <= N  <= 100 1 <= Each integer value <= 100  Example Input/Output 1   Input  4 2 4 2 3   Output  2  Example Input/Output 2   Input  11 2 1 4 3 4 3 4 5 3 4 6   Output  1 3 4  Max Execution Time Limit: 100 millisecs   Solution   Programming Language: Python 3 Language  n= int ( input ());k=[] l= list ( map ( int , input ().split())) for ...
Click to Continue...

Swap First & Third Parts - Nth Character

PKJ
 Coding Problem Keys   Swap First & Third Parts - Nth Character   Problem Statement  The program must accept a string S and an integer N as the input. The program must divide the string S into three equal parts and swap the first and third parts. Then the program must print the Nth character when the modified string is repeated infinite number of times as the output. Note: The length of S is always divisible by 3.  Boundary Condition(S)  3 <= Length of S <= 99 1 <= N <= 10 ⁸  Input Format  The first line contains S. The second line contains N.  Output Format  The first line contains a character from modified string S.  Example Input/Output 1   Input  SkillRack 7  Output  S  Explanation  After swapping the first and third parts in the string S, it becomes ack llR Ski . Now the 7th character in the modified string is S . Hence the output is S.  Example Input/Output 2...
Click to Continue...