# Uniq Command #3 HackerRank Solution

#### ByBrokenprogrammers

Dec 11, 2022

Hello Programmers, In this post, you will know how to solve the Uniq Command #3 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 text file, count the number of times each line repeats itself (only consider consecutive repetions). Display the count and the line, separated by a space. There shouldn’t be leading or trailing spaces. Please note that the uniq -c command by itself will generate the output in a different format.

This time, compare consecutive lines in a case insensitive manner. So, if a line X is followed by case variants, the output should count all of them as the same (but display only the form X in the second column).

So, as you might observe in the case below: aa, AA and Aa are all counted as instances of ‘aa’.

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 (if we ignore case – AA, Aa are the same as ‘aa’)

### Uniq Command #3 HackerRank Solution

```#compare consecutive lines in a case insensitive manner. So, if a line X is followed by case variants, the output should count all of them as the same (but display only the form X in the second column).
uniq -i -c | cut -c7-```

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