Words Starting with Upper Case

PKJ

 Coding Problem Keys 

 Words Starting with Upper Case 

 Problem Statement 

The program must accept a string S containing multiple words as the input. The program must print the words starting with an upper case alphabet in S as the output. If there is no such word, the program must print -1 as the output.

 Input Format 

The first line contains N.
The second line contains N integers separated by a space.

 Output Format 

The first line contains the integer value(s) based on the given conditions.

 Boundary Condition(s) 

3 <= Length of S < 100

 Example Input/Output 1 

 Input 

How are you? I am FINE

 Output 

How I FINE

 Explanation 

The words starting with an upper case alphabets are How, I and FINE.
Hence the output is How I FINE.

 Example Input/Output 2 

 Input 

Cricket Match 1: India vs Pakistan

 Output 

Cricket Match India Pakistan

 Example Input/Output 3 

 Input 

hi dora, is this your map?

 Output 

-1

 Max Execution Time Limit: 500 millisecs 

 Solution 

 Programming Language: Python 3 Language 

l=list(input().strip().split())
f=0
for i in l:
    if(i[0].isupper()):
        print(i,end=" ")
        f=1
if(f==0): print("-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

Toggle Consonants Adjacent to Vowels

PKJ
 Coding Problem Keys   Toggle Consonants Adjacent to Vowels   Problem Statement  The program must accept a string S containing only alphabets both in lower and upper case. The program must toggle the case of the consonants (non-vowels) adjacent to the vowels.  Boundary Condition(s)  2 <= Length of the string S <= 100  Input Format  The first line contains the string value S.  Output Format  The first line contains the toggle consonants between vowels.  Example Input/Output 1   Input  adJaeCent  Output  aDjaeceNt  Example Input/Output 2   Input  mAtRIMonY  Output  MATrImoNY  Note:  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  s= input ().strip() vow= "AEIOUaeiou" for i in range ( len (s)): if s[i] not in vow and ((i> 0 and s[i- 1 ] in vow) or (i+ 1 < len (s) and s[i+ 1 ] in vow)): print (s[i].swapcase(),end= "" ) else : print (s[i],end= "" ) # Publ
Click to Continue...

String Pattern - Inverted U

PKJ
 Coding Problem Keys   String Pattern - Inverted U   Problem Statement  Three strings S1, S2 and S3 are passed as the input. The program must print the pattern as shown in the Example Input/Output section. Out of these three strings, the two strings that are print along the left most column and the right most column will be of the same length. The string printed along the first row may or may not be equal in length to the other two strings but it's first character will be same as the first character of the string in the left most column and it's last character will be as same as the first character of the string in the right most column. The string values appearing on the top, left, right can appear in any order in the input.  Boundary Condition(s)  2 <= Length of strings <= 1000  Input Format  The first line contains the string value S1. The second line contains the string value S2. The third line contains the string value S3.  Output Format  The program must print the o
Click to Continue...

Balloon Count Burst by Ath Kid

PKJ
 Coding Problem Keys   Balloon Count Burst by Ath Kid   Problem Statement  There are N filled balloons each painted with a random number B(i) where i is from 1 to N and the balloons are tied up to a rope in a straight line. M kids who play football arrive and they decide to burst the balloons with the numbers divisible by their jersey numbers J(a) where a is from 1 to M. The program must print the count C of the balloons burst by the A-th Kid (1 <= A <= M).  Boundary Condition(s)  1 <= N <= 9999 1 <= M <= 20 1 <= A <= M  Input Format  The first line contains N, M, A each separated by a space . The second line contains N positive integers which denote the numbers on the balloons separated by a space. The third line contains M positive integers which denote the numbers on the jerseys separated by a space.  Output Format  The first line contains C.  Example Input/Output 1   Input  12 3 2 38 40 11 46 44 48 35 14 39 44 23 45 2 3 11  Output  2  Explanation  Here A = 2
Click to Continue...

Java - Method Overriding - Area

PKJ
 Coding Problem Keys    Java - Method Overriding - Area    Problem Statement  The main method in  Hello.java  is given below. import java.util.Scanner ; public class Hello { public static void main (String[] args) { Scanner scan = new Scanner(System. in ); int side = scan. nextInt (); Square square = new Square(side); Square cube = new Cube(side); System. out . println (square. getArea ()); System. out . println (cube. getArea ()); } } Please fill in the missing lines of code for the class  Square.java  and  Cube.java  so that the program prints the output as mentioned below. Area of Square = a ² , Area of Cube = 6a ²  Example Input/Output   Input  5  Output  25 150  Note:  Max Execution Time Limit: 5000 millisecs   S olution   Programming Language: Java Language   Square.java  class Square { int num, a; Square( int n) { num = n; a = num*num; } public int getArea () {
Click to Continue...

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 numWays (input1,input2): if (input2<input1): return 0 res= 1 input1+=input2- 1 input2=input1- 1 if (input2>inp
Click to Continue...

Traverse Square Matrix - Spiral Clockwise

PKJ
 Coding Problem Keys   Traverse Square Matrix - Spiral Clockwise   Problem Statement  A square matrix of size N*N is provided. The program must traverse the matrix spirally and print the elements in a single line.  Boundary Condition(s)  2 <= N <= 100 0 <= C(i, j) <= 9999  Input Format  The first line contains N. Next N lines, contain N column values C(i, j) each separated by a space.  Output Format  The first line contains N*N values separated by a space.  Example Input/Output 1   Input  2 1 2 3 4  Output  1 2 4 3  Example Input/Output 2   Input  4 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16  Output  1 2 3 4 8 12 16 15 14 13 9 5 6 7 11 10  Example Input/Output 3   Input  5 2 7 7 7 9 10 2 4 2 10 2 9 4 9 2 7 15 10 14 10 12 9 15 12 2  Output  2 7 7 7 9 10 2 10 2 12 15 9 12 7 2 10 2 4 2 9 14 10 15 9 4  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  n= int ( input ()) l=[ input ().split() for i in range (n)] m= 0 ;i= 0 ;j=
Click to Continue...

Football Player - Total Dribble Paths

PKJ
 Coding Problem Keys   Football Player - Total Dribble Paths   Problem Statement  A football coach wants his team to improve their dribbling skills. So he sets up a R*C grid, where R is the number of rows and C is the number of columns. From any given cell, a player can only dribble to the right cell or bottom cell. A player always starts from top left most cell and must end at bottom right most cell where he can collect the reward if he has dribbled according to the rules above. The program must accept R, C and print the total number of possible paths P in which a player can reach the destination.  Boundary Condition(s)  1 <= R, C <= 100  Input Format  The first line contains N. The second line contains C.  Output Format  The first line contains P.  Example Input/Output 1   Input  2 3  Output  3  Example Input/Output 2   Input  3 3  Output  6  Example Input/Output 3   Input  25 21  Output  1761039350070  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Lan
Click to Continue...