Cut #8 HackerRank Solution

Hello Programmers, In this post, you will know how to solve the Cut #8 HackerRank Solution. This problem is a part of the HackerRank Linux Shell Series.

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.

Problem

Given a sentence, identify and display its first three words. Assume that the space (‘ ‘) is the only delimiter between words.

Input Format

A text file with lines of ASCII text only. Each line has exactly one sentence.

Constraints

• 1 <= N <= 100
• (N is the number of lines of text in the input file)

Output Format

The output should contain N lines. For each input sentence, identify and display its first three words. Assume that the space (‘ ‘) is the only delimiter between words.

Sample Input

New York is a state in the Northeastern and Mid-Atlantic regions of the United States.
New York is the 27th-most extensive, the third-most populous populated of the 50 United States.
New York is bordered by New Jersey and Pennsylvania to the south.
About one third of all the battles of the Revolutionary War took place in New York.
Henry Hudson’s 1609 voyage marked the beginning of European involvement with the area.

Sample Output

New York is
New York is
New York is
About one third
Henry Hudson’s 1609

Cut #8 HackerRank Solutions

#The output should contain N lines. For each input sentence, identify and display its first three words. Assume that the space (' ') is the only delimiter between words.
cut -d " " -f 1-3

Note: This problem (Cut #8) is generated by HackerRank but the Solution is Provided by  BrokenProgrammers. This tutorial is only for Educational and Learning purposes.

Next: Cut #9 HackerRank Solution