All Tracks Algorithms String Algorithms Basics of String Manipulation Problem

UpUp
Tag(s):
No tags
Problem
Editorial
Analytics

You are given a string S. S consists of several words separated by one or more spaces. Word consists of Latin letters as well as other symbols (but not spaces).
In each word which starts from lowercase Latin letter replace starting letter with uppercase Latin letter.

Input
The only line contains S

Output
Output one line with modified string S.

Constraints
1 <= length of S <= 30 000

SAMPLE INPUT
Wish you were here
SAMPLE OUTPUT
Wish You Were Here
Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: Bash, C, C++, C++14, C++17, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, Java 14, JavaScript(Rhino), JavaScript(Node.js), Julia, Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, Python 3.8, R(RScript), Racket, Ruby, Rust, Scala, Swift-4.1, Swift, TypeScript, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

This Problem was Asked in

HackerEarth

Challenge Name

Code Monk (String Algorithms)

OTHER PROBLEMS OF THIS CHALLENGE
  • Data Structures > Advanced Data Structures
  • Data Structures > Hash Tables
  • Algorithms > String Algorithms
Notifications
View All Notifications

?