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

Desktop Products

PKJ
 Coding Problem Keys   Desktop Products   Problem Statement  A company DigiComparts manufactures 52 types of unique products for laptop and desktop computers. It manufactures 10 types of laptop products and 42 types of desktop products. Each product manufactured by the company has a unique productID from a-z and and A-Z. The laptop products have productIDs (a, i, e, o, u, A, I, E, O, U) while the rest of the productIDs are assigned to the desktop products. The company manager wishes to find the sales data for the desktop products. Given a list of productIDs of the sales of the last N products, write an algorithm to help the manager find the productIDs of the desktop products.  Input Format  The first line of the input consists of an integer numOfProducts, representing the number of products to be considered in the sales data (N). The second line consists of N space-separated characters - productID 1 , productID 2 , ... , productID N  represen...
Click to Continue...

Consonants Count in Sliding Window

PKJ
 Coding Problem Keys   Consonants Count in Sliding Window   Problem Statement  The program must accept an integer K and a string S containing only alphabets as the input. The program must print the count of consonants in each sliding window of size K in the string S as the output.  Input Format  The first line contains K. The second line contains S.  Output Format  The first line contains the count of consonants in each sliding window of size K in the string S.  Example Input/Output 1   Input  3 pineapple  Output  2 1 1 1 2 3 2  Explanation  The sliding window size K = 3. 1st window is pin -> 2 consonants 2nd window is ine -> 1 consonants 3rd window is nea -> 1 consonants 4th window is eap -> 1 consonants 5th window is app -> 2 consonants 6th window is ppl -> 3 consonants 7th window is ple -> 2 consonants  Example Input/Output 2   Input  2 PROGRAMMING...
Click to Continue...

Pattern Printing Middle Letter - Odd Length String

PKJ
 Coding Problem Keys   Pattern Printing Middle Letter - Odd Length String   Problem Statement  An odd length string S is passed as the input. The program must print the pattern as described below. Let L be the length of the string and M denote the middle position of the string S. The characters in the string are a(1),...., a(M), .... a(L).     - The first line will contain the middle letter a(M) of S in the extreme right.     - Then in each subsequent line, the letter after the middle letter from a(M + 1) to a(L) is appended to the line output.     - After the end of the string a(L) is reached, in each subsequent line, the letters from the beginning to the middle letter, a(1) to a(M-1) are appended to the line output. Note: Asterisk * will be used to pad in the front so that each line has L characters.  Input Format  The first line contains the S.  Output Format  L lines as output where L is the length of t...
Click to Continue...

Equal Count - Vowels & Consonants

PKJ
 Coding Problem Keys   Equal Count - Vowels & Consonants   Problem Statement  The program must accept a string S (consisting of only vowels and consonants) and an integer N . The program must print the number of substring values of length N which have equal count of vowels and consonants. Note: The value of N is always even.  Input Format  The first line contains S. The second line contains N.  Output Format  The first line contains the count of consonants in each sliding window of size K in the string S.  Boundary Condition(s)  1 <= Length of S <= 10 ⁵ 2 <= N <= Length of S  Example Input/Output 1   Input  havenhelljoysorrow 4  Output  5  Explanation  There are 5 substring values of  length N = 4, which have equal count of vowels and consonants. have, aven, enhe, oyso, orro.  Example Input/Output 2   Input  skillrack 2  Output  4 ...
Click to Continue...

Top Scoring Batsman - TEST ODI 20-20

PKJ
 Coding Problem Keys   Top Scoring Batsman - TEST ODI 20-20   Problem Statement  The program must accept the runs scored by N batsmen in the various cricket formats - TEST, ODI and 20-20 and print the top scoring batsman.     - In case two batsmen have scored same total runs, consider TEST cricket runs. The batsman who has scored higher runs in TEST cricket is the top scoring batsman.     - In case two batsmen have scored same total runs and have TEST cricket runs equal, consider ODI runs.     - In case two batsmen have scored same total runs and have TEST and ODI runs equal, consider 20-20 runs.  Boundary Condition(s)  1 <= N <= 20  Input Format  The first line contains the value of N. N lines follow with each line containing Batsman Name and runs in TEST, ODI and 20-20 runs (the values are separated by a space).  Output Format  The first line contains the name of the top Scoring Batsman. ...
Click to Continue...

Salesforce

PKJ
 OFF CAMPUS DRIVE   Salesforce   Role: Associate Technical Support Engineer    Job Details   Role Description  Assisting customers in troubleshooting their custom code, integration, and implementation of Salesforce products. This involves debugging, troubleshooting, and ensuring issues are fully resolved. Developing and maintaining technical expertise in assigned areas of product functionality. Demonstrating outstanding analytical and problem-solving expertise. Providing feature explanation and Salesforce coding practices. Handling customer expectations and the customer experience to improve customer happiness. Actively maintaining and participating in job-related training activities.  Required Qualification/Skills  Superb Communication - Verbal and Written Strong analytical and problem-solving skills Be a self-starter and possess strong sense of self-motivation Willingness to work in flexible shift timings.  Duration...
Click to Continue...

N Characters Forward Reverse

PKJ
 Coding Problem Keys   N Characters Forward Reverse   Problem Statement  The program must accept a string S and an integer value N. Then the program must print the first N characters, then must print the next N characters in reverse direction and so on.  Boundary Condition(S)  1 <= Length of S <= 1000  Input Format  The first line contains S. The second line contains N.  Output Format  The first line contains a string value.  Example Input/Output 1   Input  abcdefghijk 3  Output  abcfedghikj  Explanation  Here N is 3. So abc is printed. Then fed are reversed and printed. Then ghi is printed. The remaining characters kj are reversed and printed.  Example Input/Output 2   Input  mango 2  Output  magno  Note: Max Execution Time Limit: 50 millisecs   Solution   Programming Language: Python 3 Language  l= input ().strip() k...
Click to Continue...