Uniq Command #2 HackerRank Solution

Hello Programmers, In this post, you will know how to solve the Uniq Command #2 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.

report this adProblem

In this challenge, we practice using the uniq command to eliminate consecutive repetitions of a line when a text file is piped through it.

Given a text file, count the number of times each line repeats itself. Only consider consecutive repetitions. Display the space separated count and line, respectively. There shouldn’t be any leading or trailing spaces. Please note that the uniq -c command by itself will generate the output in a different format than the one expected here.

Sample Input

00
00
01
01
00
00
02
02
03
aa
aa
aa

Sample Output

2 00
2 01
2 00
2 02
1 03
3 aa

Explanation

00 is repeated twice
01 is repeated twice
00 is repeated twice
02 is repeated twice
03 occurs once
aa is repeated thrice

Uniq Command #2 HackerRank Solutions

#Given a text file, count the number of times each line repeats itself. Only consider consecutive repetitions. Display the space separated count and line, respectively. There shouldn't be any leading or trailing spaces. Please note that the uniq -c command by itself will generate the output in a different format than the one expected here.
uniq -c | cut -c7- 

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

Next: Uniq Command #3 HackerRank Solution