Alphabetical Order Pattern

PKJ

 Coding Problem Keys 

 Alphabetical Order Pattern 

 Problem Statement 

The program must accept a string S containing only alphabets as the input. The program must print all the alphabets of S in alphabetical order with respect to their positions as shown in the Example Input/Output Section.

 Input Format 

The first line contains the value of S.

 Output Format 

The first line contains the desired pattern as shown in the Example Input/Output Section.

 Constraints 

3 <= Length of S <= 100

 Example Input/Output 1 

 Input 

Tenth

 Output 

*e***
****h
**n**
T**t*

 Example Input/Output 2 

 Input 

SkillRack

 Output 

******a**
*******c*
**i******
*k******k
***ll****
*****R***
S********

 Max Execution Time Limit: 500 millisecs 

 Solution 

 Programming Language: Python 3 Language 

l=input().strip()
k=[x.lower() for x in l]
d=0
f=sorted(list(set(k)))
for i in range(len(f)):
    p=""
    for j in l:
        if(j.lower()==f[d]):
            p+=j
        else:
            p+="*"
    d+=1
    print(p)

# 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

Mango Distribution

PKJ
 Coding Problem Keys   Mango Distribution   Problem Statement  Given a number of mangoes and number of persons. Find the number of ways to distribute the identical mangoes among identical persons.  Input Specification  input1: the number of mangoes input2: the number of persons.  Output Specification  Return the number of ways to distribute identical mangoes among identical persons.  Sample Input/Output 1   Input  input1: 2 input2: 2   Output  Output: 3   Explanation  All possible distributions of 2 identical mangoes to 2 identical persons are (1, 1), (2, 0) and (0, 2). Hence the output is 3.  Sample Input/Output 2   Input  input1: 1 input2: 12  Output  Output: 12   Output  All possible distributions of 1 identical mango to 12 identical persons are 12. Hence the output is 12.  Solution   Programming Language: Python 3 Language  def nu...
Click to Continue...

Maximum Goods Transported

PKJ
 Coding Problem Keys   Maximum Goods Transported   Problem Statement  There are goods to be transported by trains through a series of N stations which are numbered from 1 to N. Each station has at most one incoming railroad and at most one outgoing railroad. There are T tracks and each track connecting two stations has a capacity limit to transport goods. The stations with no incoming railroad are the sources and the stations with no outgoing railroad are the destinations. The program must print the maximum amount of goods that can be transported.  Boundary Condition(s)  2 <= N <= 30. 1 <= T <= 60. 1 <= capacity <= 1000.  Input Format  The first line contains N and T separated by space(s). The next T lines contain starting station number, ending station number and capacity limit of the track each separated by space(s).  Output Format  The first line contains value of maximum amount of goods that can be transpo...
Click to Continue...

Value Equals Previous Two

PKJ
 Coding Problem Keys   Value Equals Previous Two   Problem Statement  An array of N integers is passed as the input. The program must find the combination of integers forming a sequence whose length is more than 4 which satisfies the below conditions.     - The i-th index must satisfy arr[i] = arr[i-1] + arr[i-2].     - The length of the sequence must be the maximum possible.     - If there are more than one sequences satisfying the above two conditions, then print the sequence which contains the smaller value integers. If there is no such combination of integers, 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 in the sequence or -1.  Boundary Condition(s)  1 <= N  <= 25  Example Input/Output 1   Input  9...
Click to Continue...

RAT CHEESE MAZE

PKJ
 Coding Problem Keys   RAT CHEESE MAZE   Problem Statement  Moozak the mouse has been placed in the top left corner of a maze. There is a huge chunk of cheese somewhere in the maze which is represented by 9. The maze is represented as a matrix of integers, where 0 denotes a wall, 1 denotes a path and 9 represents the huge chunk of cheese. Fill in the lines of code for the method isPath to determine if Moozak can reach the huge chunk of cheese. The method should return 1 if there is a path from Moozak (top left corner) to the cheese. The method isPath must return 0 if there is no path. Moozak cannot climb the walls or go out of the maze but can go left, right, up or down.  Input Format  The first line contains 8 integer values (one among 0, 1 or 9) separated by a space.   Output Format  The first line contains either 1 or 0  Example Input/Output 1   Input  1 0 1 1 1 0 0 1 1 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 1 0 1 0 9 0 1 1...
Click to Continue...

Left Right Top Bottom Sum

PKJ
 Coding  Problem  Keys   Left Right Top Bottom Sum    Problem Statement  The program must accept a matrix of size R*C and for each cell the program must print the sum of left, right, top and bottom cells.  Boundary Conditions  2 <= R, C <= 20 1 <= Matrix element value <= 10 ⁵ Input Format The first line contains R and C separated by a space. The next R lines, each contains C integers separated by a space. Output Format The first R lines, each contains C integers separated by a space.  Example Input/Output 1   Input  5 4 7 3 8 4 8 1 10 4 4 8 4 6 3 2 2 1 1 1 10 1  Output  11 16 17 12 12 29 17 20 19 11 26 9 7 14 17 9 4 13 4 11  Example Input/Output 2   Input  3 3 1 2 3 4 5 6 7 8 9  Output  6 9 8 13 20 17 12 21 14  Note:  Max Execution Time Limit: 50 millisecs   Solution   Programming Language: C Language  #include<stdio.h> #inc...
Click to Continue...

Iterate Base

PKJ
 Coding Problem Keys   Iterate Base   Problem Statement  The program must accept a number N in any base from 2 to 36. We can identify the base that would result in a least value for the given representation. Consider the following examples. 1. For the number representation 11, the least possible base is 2 and hence the least possible value is 3 in base 10. 2. For 17, the least possible base is 8 and the least possible value is 15 is base 10. 3. For 1729, the least possible base in 10 and the least possible value is 1729 in base 10. Consider doing this base reduction iteratively till a fixed point is reached as shown in the following example: Let's start with the number representation 72. The least possible value of 72 is in base 8 and is 58 (represented in base 10). Iterating, the least possible value of 58 is in base 9 and is 53 (base 10). In the next iteration, 53 (in base 6) becomes 33. Then, 33 (base 4) gives 15, 15 (base 6) gives 11, 11 (base 2) ...
Click to Continue...