CT27295

Gautam's letters Reckoning

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Deep in the lakeside town of Mirrormere, Gautam studies rows of letters entries. One clean number will settle the guild's oldest argument. Task: Read a line of space-separated words and print the longest word. If several share the maximum length, print the first. Input format: One line with words separated by single spaces. Output format: Print the longest word. Constraints: 1 <= |s| <= 1414; s contains lowercase English letters.

Example 1:

Input: nrruluifi pe uplmdnwyqyy bnz i p gdyhpxu euk
Output: uplmdnwyqyy

Example 2:

Input: icenyyj
Output: icenyyj

Example 3:

Input: gjjv dshzi xscwfpqd qzjgjisw t ine vkrdpev kquzdurdcpf tgxmm zrz uqaleq lfzwku
Output: kquzdurdcpf

Constraints:

1 <= |s| <= 1414; s contains lowercase English letters.

Loading...
Test Cases:No test cases
No test cases available.
Gautam's letters Reckoning - EASY Coding Problem | CodeTikki