HackerRank ‘Uniq’ Command #1 problem solution

In this HackerRank ‘Uniq’ Command #1 problem solution In this challenge, we practice using the uniq command to eliminate consecutive repetitions of a line when a text file is piped through it. we have given a text file, remove the consecutive repetitions of any line.

Plain Uniq

If this is the file test.txt:

00

00

01

01

00

00

02

02

This is the output on passing it through the uniq command, either via pipes or as input via STDIN:

Command:  uniq < test.txt 

00

01

00

02  

The first two lines of the original file are the same, (00). The next two lines are (01) which are followed by two repetitions of (00) again and two repetitions of (02). The uniq command replaces the consecutive repetitions with only one line in each case.

Other possible options:

1. Limit comparison only to the first N characters (using the -w option).
2. Avoid comparing the first N characters (using the -s option).
3. Ignore variations in case between lines (using the -i option).
4. Avoid comparing the first N fields (using the -f option).
5. Prints those lines that are succeeded and preceded by different lines (using the -u option).
6. Prints those lines that are followed by one or more repetitions immediately after them (using the -d option).
7. Print the count of repetitions for each of the lines it collapses (using -c option).

Problem solution.

uniq