Print Alphabets

PKJ

 Coding Problem Keys 

 Print Alphabets 

 Problem Statement 

Given two alphabets C1 and C2 as input, the program must print the alphabets from C1 to C2 (inclusive of C1 and C2).

 Boundary Condition(s) 

a <= C1 < z
C1 < C2 <= z

 Input Format 

The first line contains the two alphabets C1 and C2 separated by space(s).

 Output Format 

The first line contains the alphabets from C1 to C2 (inclusive of C1 and C2) separated by a space.

 Example Input/Output 1 

 Input 

a d

 Output 

a b c d

 Explanation 

The alphabets from a to d is abcd. Hence the output is a b c d.

 Example Input/Output 2 

 Input 

g l

 Output 

g h i j k l

 Explanation 

The alphabets from g to l is ghijkl. Hence the output is g h i j k l.

 Max Execution Time Limit: 5000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

a,b=input().split()
for i in range(ord(a),ord(b)+1):
    print(chr(i),end=" ")

# 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

Reversed Sum of Pairs

PKJ
 Coding Problem Keys   Reversed Sum of Pairs    Problem Statement  An array of N integers is passed as input. The program must print the sum of every two consecutive elements in the array from last.  Boundary Condition(s)  1 <= N <= 1000  Input Format  The first line contains N . The second line contains N integers separated by space(s).  Output Format  The first line contains the sum of pairs separated by a space.  Example Input/Output 1   Input  4 10 50 30 60  Output  90 60  Example Input/Output 2   Input  5 25 50 100 250 300  Output  550 150 25  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: C Language  #include <stdio.h> #include <stdlib.h> int main () { int n,i; scanf( "%d" ,&n); int arr[n]; for ( int i= 0 ;i<n;i++){ scanf( "%d" ,&arr[...
Click to Continue...

Find Generation Gap

PKJ
 Coding Problem Keys   Find Generation Gap   Problem Statement  The family hierarchy is given in N lines. Each lines contains parent and child separated by a space. The program must find the number of generations present between the first and last generation.  Boundary Condition(s)  1 <= N <=100 1 <= Length of parent, child <= 100  Input Format  The first line contains the N. The next N lines contain the percent and child names separated by a space.  Output Format  The first line contains the specified output.  Example Input/Output 1   Input  3 son grandson father son grandfather father  Output  2  Explanation  The first generation member is grandfather. The last generation member is grandson. There are two generations between them (father and son) hence the output is 2.  Example Input/Output 2   Input  6 grandfather father father son1 father son2 son1 gran...
Click to Continue...

Infinite Sequence Nth Digit

PKJ
 Coding Problem Keys   Infinite Sequence Nth Digit   Problem Statement  The program must accept an integer value N and print the Nth digit in the integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 and so on till infinity.  Input Format  The first line contains the value of N.  Output Format  The first line contains one of the digits from 0 to 9.  Constraints  1 <= N  <= 10 ⁹  Example Input/Output 1   Input  5   Output  5   Explanation  The 5th digit in the sequence 1234567 is 5.  Example Input/Output 2   Input  11   Output  0  Explanation  The 11th digit in the sequence 12345678910 is 0.  Max Execution Time Limit: 400 millisecs   Solution   Programming Language: Python 3 Language  def funcDigit (n): x, y, m = 1 , 1 , {} while x <= 10 : m[x] = y y = ...
Click to Continue...

Pattern - X to Y Rotate

PKJ
 Coding Problem Keys   Pattern - X to Y Rotate   Problem Statement  The program must accept two integers X and Y and print the pattern described in the Example Input/Output section.  Input Format  The first line contains X and Y separated by a space.  Output Format  The Y-X+1 lines containing the desired pattern.  Boundary Condition(s)  2 <= X, Y <= 100 X < Y  Example Input/Output 1   Input  5 10  Output  5 6 7 8 9 10 6 7 8 9 10 5 7 8 9 10 5 6 8 9 10 5 6 7 9 10 5 6 7 8 10 5 6 7 8 9  Note:  Max Execution Time Limit: 5000 millisecs   S olution   Programming Language: Python 3 Language  a,b= map ( int , input ().split()) l=[i for i in range (a,b+ 1 )] for i in range ((b-a)+ 1 ): print (*l) l=l[ 1 :]+[l[ 0 ]] # Published By PKJCODERS  Programming Language: Python 3 Language  x,y= map ( int , input ().split()) l=[i for i in r...
Click to Continue...

Reverse Characters in a string

PKJ
 Coding Problem Keys   Reverse Characters in a string    Problem Statement  Write a function to reverse all the characters of each word in an input string for example input1, capitalize only the first letter of each word and return the output1.  Input Specification  input1: An input string  Output Specification  Return a string with the characters of each word in the reverse order and print the string with the first letter of each word capitalized.  Example Input/Output 1   Input  Hello World  Output  Olleh Dlrow  Explanation  The reverse of the word "Hello" with its first letter capitalized is "Olleh" and similarly for the word "World", it is "Dlrow". Hence the output string returned is Olleh Dlrow.  S olution   Programming Language: Python 3 Language  a= list ( input ().split()) for i in range ( len (a)): a[i]=a[i].lower() print (a[i][::- 1 ].capitalize(),end= " ...
Click to Continue...

Count the 1s in the binary representation

PKJ
 Coding Problem Keys   Count the 1s in the binary representation   Problem Statement  A positive integer N is passed as the input. The program must print the number of 1s in the binary representation of N.  Boundary Condition(S)  1 <= N <= 9000000000000000000  Input Format  The first line will contain the value of N.  Output Format  The first line will contain the count of 1s in their binary representation.  Example Input/Output 1   Input  22  Output  3  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  print ( bin ( int ( input ()))[ 2 :].count( '1' )) # 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...