Problem:-
There is a sentence that consists of space-separated strings of upper and lower case English letters. Transform each string according to the given algorithm and return the new sentence.
Each string should be modified as follows:
• The first character of the string remains unchanged
• For each subsequent character, say x, consider a letter
preceding it, say y:
• If y precedes x in the English alphabet, transform x to uppercase
o If x precedes y in the English alphabet, transform x to lowercase
If x and y are equal, the letter remains unchanged
Each string should be modified as follows:
• The first character of the string remains unchanged
• For each subsequent character, say x, consider a letter
preceding it, say y:
• If y precedes x in the English alphabet, transform x to uppercase
o If x precedes y in the English alphabet, transform x to lowercase
If x and y are equal, the letter remains unchanged
Example
sentence = "cOOL dog"
The first letters of both words remain unchanged. Then, for the word "COOL" the first "o" is made uppercase because the letter preceding it, "c", comes earlier in the alphabet. Next, the case of the second "O" is unchanged because the letter preceding is also "o", and finally the "L" is made lowercase because the letter preceding it, "O", comes later in the alphabet. The second word, "dOg", is transformed according to the same rules. Return the resulting sentence 'cool dog'.
Function Description
Complete the function transformSentence in the editor below. The function must return a string representing the resulting sentence.
transformSentence has the following parameter(s): string sentence: the input sentence
Code:-
def transformSentence(sentence):
l=sentence.split()
li=[]
st=""
for i in l:
st+=i[0]
for j in range(0,len(i)-1):
if(i[j].lower()<i[j+1].lower()):
st+=(i[j+1].upper())
elif(i[j].lower()>i[j+1].lower()):
st+=(i[j+1].lower())
else:
st+=i[j+1]
li.append(st)
st=""
result=""
for i in li:
result=result+" "+i
return (result.strip())
# Write your code here
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
sentence = input()
result = transformSentence(sentence)
fptr.write(result + '\n')
fptr.close()
Recommended Post:
Key points:-
- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
- How to check that given number is power of 2 or not
- How to fix limit in double and floating numbers after dot (.) in c++
- How to print a double or floating point number in scientific notation and fixed notation
- How to take input a string in c
- How to reduce the execution time of program in c++.
Cracking the coding interview:-
Array and string:-
Tree and graph:-
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-
- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Sum of Digits of a Five Digit Number | hackerrank practice problem solution
- 1D Arrays in C | hackerrank practice problem solution
- Array Reversal | hackerrank practice problem solution
- Printing Tokens | hackerrank practice problem solution
- Digit Frequency | hackerrank practice problem solution
- Calculate the Nth term | hackerrank practice problem solution
Data structure:-
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
MCQs:-
0 Comments