Exercise solutions


One-liner introduction

1) For the input file ip.txt, display all lines containing is.

$ cat ip.txt
Hello World
How are you
This game is good
Today is sunny
12345
You are funny

$ ruby -ne 'print if /is/' ip.txt
This game is good
Today is sunny

2) For the input file ip.txt, display the first field of lines not containing y. Consider space as the field separator for this file.

$ ruby -ane 'puts $F[0] if !/y/' ip.txt
Hello
This
12345

3) For the input file ip.txt, display all lines containing no more than 2 fields.

$ ruby -ane 'print if $F.size <= 2' ip.txt
Hello World
12345

4) For the input file ip.txt, display all lines containing is in the second field.

$ ruby -ane 'print if $F[1] =~ /is/' ip.txt
Today is sunny

5) For each line of the input file ip.txt, replace the first occurrence of o with 0.

$ ruby -pe 'sub(/o/, "0")' ip.txt
Hell0 World
H0w are you
This game is g0od
T0day is sunny
12345
Y0u are funny

6) For the input file table.txt, calculate and display the product of numbers in the last field of each line. Consider space as the field separator for this file.

$ cat table.txt
brown bread mat hair 42
blue cake mug shirt -7
yellow banana window shoes 3.14

$ ruby -ane 'BEGIN{p = 1}; p *= $F[-1].to_f; END{puts p}' table.txt
-923.1600000000001

7) Append . to all the input lines for the given stdin data.

# can also use: ruby -lne 'print "#{$_}."'
$ printf 'last\nappend\nstop\ntail\n' | ruby -pe 'sub(/$/, ".")'
last.
append.
stop.
tail.

8) Use contents of the s variable to display matching lines from the input file ip.txt. Assume that s doesn't have any regexp metacharacters. Construct the solution such that there's at least one word character immediately preceding the contents of the s variable.

$ s='is'

# can also use: ruby -sne 'print if /\B#{$r}/' -- -r="$s" ip.txt
$ r="$s" ruby -ne 'print if /\B#{ENV["r"]}/' ip.txt
This game is good

9) Use system to display the contents of the filename present in the second field of the given input line. Consider space as the field separator.

$ s='report.log ip.txt sorted.txt'
$ echo "$s" | ruby -ane 'system("cat #{$F[1]}")'
Hello World
How are you
This game is good
Today is sunny
12345
You are funny

$ s='power.txt table.txt'
$ echo "$s" | ruby -ane 'system("cat #{$F[1]}")'
brown bread mat hair 42
blue cake mug shirt -7
yellow banana window shoes 3.14

Line processing

1) For the given input, display except the third line.

# can also use: ruby -ne 'print if $. != 3'
$ seq 34 37 | ruby -pe 'next if $. == 3'
34
35
37

2) Display only the fourth, fifth, sixth and seventh lines for the given input.

$ seq 65 78 | ruby -ne 'print if 4..7'
68
69
70
71

3) For the input file ip.txt, replace all occurrences of are with are not and is with is not only from line number 4 till the end of file. Also, only the lines that were changed should be displayed in the output.

$ cat ip.txt
Hello World
How are you
This game is good
Today is sunny
12345
You are funny

# can also use: $_.gsub!(/(are|is)\K/, " not")
$ ruby -ne 'print if $. >= 4 && $_.gsub!(/are|is/, "\\0 not")' ip.txt
Today is not sunny
You are not funny

4) For the given stdin, display only the first three lines. Avoid processing lines that are not relevant.

$ seq 14 25 | ruby -pe 'exit if $. > 3'
14
15
16

5) For the input file ip.txt, display all lines from the start of the file till the first occurrence of game.

$ ruby -ne 'print; exit if /game/' ip.txt
Hello World
How are you
This game is good

6) For the input file ip.txt, display all lines that contain is but not good.

$ ruby -ne 'print if /is/ && !/good/' ip.txt
Today is sunny

7) For the input file ip.txt, extract the word before the whole word is as well as the word after it. If such a match is found, display the two words around is in reversed order. For example, hi;1 is--234 bye should be converted to 234:1. Assume that the whole word is will not be present more than once in a single line.

# can also use: ruby -ne 'print if $_.sub!(/.*?(\w+)\W+is\W+(\w+).*/, "\\2:\\1")'
$ ruby -ne 'puts "#{$2}:#{$1}" if /(\w+)\W+is\W+(\w+)/' ip.txt
good:game
sunny:Today

8) For the input file hex.txt, replace all occurrences of 0xA0 with 0x50 and 0xFF with 0x7F.

$ cat hex.txt
start: 0xA0, func1: 0xA0
end: 0xFF, func2: 0xB0
restart: 0xA010, func3: 0x7F

$ ruby -pe 'gsub(/0xA0/, "0x50"); gsub(/0xFF/, "0x7F")' hex.txt
start: 0x50, func1: 0x50
end: 0x7F, func2: 0xB0
restart: 0x5010, func3: 0x7F

9) For the input file text.txt, replace all occurrences of in with an and write back the changes to text.txt itself. The original contents should get saved to text.txt.orig.

$ cat text.txt
can ran want plant
tin fin fit mine line

$ ruby -i.orig -pe 'gsub(/in/, "an")' text.txt

$ cat text.txt
can ran want plant
tan fan fit mane lane
$ cat text.txt.orig
can ran want plant
tin fin fit mine line

10) For the input file text.txt, replace all occurrences of an with in and write back the changes to text.txt itself. Do not create backups for this exercise. Note that you should have solved the previous exercise before starting this one.

$ cat text.txt
can ran want plant
tan fan fit mane lane

$ ruby -i -pe 'gsub(/an/, "in")' text.txt

$ cat text.txt
cin rin wint plint
tin fin fit mine line
$ diff text.txt text.txt.orig
1c1
< cin rin wint plint
---
> can ran want plant

11) Find the starting index of first occurrence of is or the or was or to for each input line of the file idx.txt. Assume that every input line will match at least one of these terms.

$ cat idx.txt
match after the last newline character
and then you want to test
this is good bye then
you were there to see?

$ ruby -ne 'puts $_.index(/is|the|was|to/)' idx.txt
12
4
2
9

12) Display all lines containing [4]* for the given stdin data.

$ printf '2.3/[4]*6\n2[4]5\n5.3-[4]*9\n' | ruby -ne 'print if $_.include?("[4]*")'
2.3/[4]*6
5.3-[4]*9

13) For the given input string, change all lowercase alphabets to x only for words starting with m.

$ s='ma2T3a a2p kite e2e3m meet'

$ echo "$s" | ruby -pe 'gsub(/\bm\w*+/) {$&.tr("a-z", "x")}'
xx2T3x a2p kite e2e3m xxxx

14) For the input file ip.txt, delete all characters other than lowercase vowels and the newline character. Perform this transformation only between a line containing you up to line number 4 (inclusive).

$ ruby -pe '$_.tr!("^aeiou\n", "") if /you/..4' ip.txt
Hello World
oaeou
iaeioo
oaiu
12345
You are funny

15) For the input file sample.txt, display from the start of the file till the first occurrence of are, excluding the matching line.

$ cat sample.txt
Hello World

Good day
How are you

Just do-it
Believe it

Today is sunny
Not a bit funny
No doubt you like it too

Much ado about nothing
He he he

$ ruby -pe 'exit if /are/' sample.txt
Hello World

Good day

16) For the input file sample.txt, display from the last occurrence of do till the end of the file.

$ tac sample.txt | ruby -ne 'print; exit if /do/' | tac
Much ado about nothing
He he he

17) For the input file sample.txt, display from the 9th line till a line containing you.

$ ruby -ne 'print if 9../you/' sample.txt
Today is sunny
Not a bit funny
No doubt you like it too

18) Display only the odd numbered lines from ip.txt.

$ ruby -ne 'print if $.%2==1' ip.txt
Hello World
This game is good
12345

19) For the table.txt file, print only the line number for lines containing air or win.

$ cat table.txt
brown bread mat hair 42
blue cake mug shirt -7
yellow banana window shoes 3.14

$ ruby -ne 'puts $. if /air|win/' table.txt
1
3

20) For the input file table.txt, calculate the sum of numbers in the last column, excluding the second line.

$ ruby -ane 'BEGIN{s=0}; s += $F[-1].to_f if $.!=2; END{puts s}' table.txt
45.14

21) Print the second and fourth line for every block of five lines.

# can also use: ruby -ne 'print if [2, 4].include?($.%5)'
$ seq 15 | ruby -ne 'print if $.%5 == 2 || $.%5 == 4'
2
4
7
9
12
14

22) For the input file ip.txt, display all lines containing e or u but not both.

$ ruby -ne 'print if (/e/ && !/u/) || (!/e/ && /u/)' ip.txt
Hello World
This game is good
Today is sunny

Field separators

1) For the input file brackets.txt, extract only the contents between () or )( from each input line. Assume that () characters will be present only once every line.

$ cat brackets.txt
foo blah blah(ice) 123 xyz$ 
(almond-pista) choco
yo )yoyo( yo

$ ruby -F'[()]' -ane 'puts $F[1]' brackets.txt
ice
almond-pista
yoyo

2) For the input file scores.csv, extract Name and Physics fields in the format shown below.

$ cat scores.csv
Name,Maths,Physics,Chemistry
Blue,67,46,99
Lin,78,83,80
Er,56,79,92
Cy,97,98,95
Ort,68,72,66
Ith,100,100,100

$ ruby -F, -ane 'puts $F.values_at(0,2) * ":"' scores.csv
Name:Physics
Blue:46
Lin:83
Er:79
Cy:98
Ort:72
Ith:100

3) For the input file scores.csv, display names of those who've scored above 70 in Maths.

$ ruby -F, -ane 'puts $F[0] if $F[1].to_i > 70' scores.csv
Lin
Cy
Ith

4) Display the number of word characters for the given inputs. Word definition here is same as used in regular expressions. Can you construct a solution with gsub and one without the substitution functions?

# solve using gsub
$ echo 'hi there' | ruby -ne 'puts gsub(/\W+/, "").size'
7

# solve without using the substitution functions
$ echo 'u-no;co%."(do_12:as' | ruby -ne 'puts $_.scan(/\w/).size'
12

5) For the input file quoted.txt, extract the sequence of characters surrounded by double quotes and display them in the format shown below.

$ cat quoted.txt
1 "grape" and "mango" and "guava"
("c 1""d""a-2""b")

$ ruby -ne 'puts $_.scan(/"[^"]+"/).sort * ","' quoted.txt
"grape","guava","mango"
"a-2","b","c 1","d"

6) Display only the third and fifth characters from each input line.

$ printf 'restore\ncat one\ncricket' | ruby -lne 'print $_[2], $_[4]'
so
to
ik

7) Transform the given input file fw.txt to get the output as shown below. If the second field is empty (i.e. contains only space characters), replace it with NA.

$ cat fw.txt
1.3  rs   90  0.134563
3.8           6
5.2  ye       8.2387
4.2  kt   32  45.1

$ ruby -ne 'a = $_.unpack("a3x2a2x7a*");
            a[1] = "NA" if a[1] == "  ";
            puts a * ","' fw.txt
1.3,rs,0.134563
3.8,NA,6
5.2,ye,8.2387
4.2,kt,45.1

8) For the input file scores.csv, display the header as well as any row which contains b or t (irrespective of case) in the first field.

$ ruby -F, -ane 'print if $.==1 || $F[0].match?(/[bt]/i)' scores.csv
Name,Maths,Physics,Chemistry
Blue,67,46,99
Ort,68,72,66
Ith,100,100,100

9) Extract all whole words containing 42 but not at the edge of a word. Assume a word cannot contain 42 more than once.

$ s='hi42bye nice1423 bad42 cool_42a 42fake'
$ echo "$s" | ruby -ne 'puts $_.scan(/\w+42\w+/)'
hi42bye
nice1423
cool_42a

10) For the input file scores.csv, add another column named GP which is calculated out of 100 by giving 50% weightage to Maths and 25% each for Physics and Chemistry.

$ ruby -F, -lane '$F.append($.==1 ? "GP" : ($F[1].to_f/2 + ($F[2].to_f+$F[3].to_f)/4));
                  puts $F * ","' scores.csv
Name,Maths,Physics,Chemistry,GP
Blue,67,46,99,69.75
Lin,78,83,80,79.75
Er,56,79,92,70.75
Cy,97,98,95,96.75
Ort,68,72,66,68.5
Ith,100,100,100,100.0

11) For the input file mixed_fs.txt, retain only the first two fields from each input line. The input and output field separators should be space for first two lines and , for the rest of the lines.

$ cat mixed_fs.txt
rose lily jasmine tulip
pink blue white yellow
car,mat,ball,basket
light green,brown,black,purple
apple,banana,cherry

$ ruby -ne 'f = $.<3? " " : ","; puts $_.split(f)[0..1] * f' mixed_fs.txt
rose lily
pink blue
car,mat
light green,brown
apple,banana

12) For the given space separated numbers, filter only numbers in the range 20 to 1000 (inclusive).

$ s='20 -983 5 756 634223 1000'

$ echo "$s" | ruby -ane 'puts $F.map(&:to_i).grep(20..1000) * " "'
20 756 1000

13) For the given space separated words, randomize the order of characters for each word.

$ s='this is a sample sentence'

# sample randomized output shown here, could be different for you
$ echo "$s" | ruby -ane 'puts $F.map {|s| s.chars.shuffle * ""} * " "'
shti si a salemp sneentce

14) For the given input file words.txt, filter all lines containing characters in ascending and descending order.

$ cat words.txt
bot
art
are
boat
toe
flee
reed

# ascending order
$ ruby -lne 'print if $_ == $_.chars.sort * ""' words.txt
bot
art

# descending order
$ ruby -lne 'print if $_ == $_.chars.sort.reverse * ""' words.txt
toe
reed

15) For the given space separated words, extract the three longest words.

$ s='I bought two bananas and three mangoes'

$ echo "$s" | ruby -ane 'puts $F.max_by(3) {_1.size}'
mangoes
bananas
bought

16) Convert the contents of split.txt as shown below.

$ cat split.txt
apple,1:2:5,mango
wry,4,look
pencil,3:8,paper

$ ruby -F, -lane '$F[1].split(/:/).each {puts [$F[0],_1,$F[2]] * ","}' split.txt
apple,1,mango
apple,2,mango
apple,5,mango
wry,4,look
pencil,3,paper
pencil,8,paper

17) For the input file varying_fields.txt, construct a solution to get the output shown below.

$ cat varying_fields.txt
hi,bye,there,was,here,to
1,2,3,4,5

$ ruby -F, -ane 'puts $F.values_at(0,1,-1) * ":"' varying_fields.txt
hi:bye:to
1:2:5

18) The fields.txt file has fields separated by the : character. Delete : and the last field if there is a digit character anywhere before the last field. Solution shouldn't use the substitution functions.

$ cat fields.txt
42:cat
twelve:a2b
we:be:he:0:a:b:bother
apple:banana-42:cherry:
dragon:unicorn:centaur

$ ruby -F: -ane '$F.pop if /\d.*:/; puts $F * ":"' fields.txt
42
twelve:a2b
we:be:he:0:a:b
apple:banana-42:cherry
dragon:unicorn:centaur

19) The sample string shown below uses cat as the field separator (irrespective of case). Use space as the output field separator and add 42 as the last field.

$ s='applecatfigCaT12345cAtbanana'

$ echo "$s" | ruby -F'(?i)cat' -lane 'puts [$F, 42] * " "'
apple fig 12345 banana 42

20) For the input file sample.txt, filter lines containing 5 or more lowercase vowels.

# can also use: ruby -ne 'print if /([aeiou][^aeiou]*+){5}/' sample.txt
$ ruby -F'[aeiou]' -ane 'print if $F.size > 5' sample.txt
How are you
Believe it
No doubt you like it too
Much ado about nothing

Record separators

1) The input file jumbled.txt consists of words separated by various delimiters. Display the last four words that contain an or at or in or it, one per line.

$ cat jumbled.txt
overcoats;furrowing-typeface%pewter##hobby
wavering:concession/woof\retailer
joint[]seer{intuition}titanic

$ ruby -0777 -ne 'puts $_.scan(/\w*[ai][nt]\w*/)[-4..]' jumbled.txt
wavering
joint
intuition
titanic

2) Emulate paste -sd, with Ruby.

# this command joins all input lines with the ',' character
$ paste -sd, ip.txt
Hello World,How are you,This game is good,Today is sunny,12345,You are funny

# make sure there's no ',' at the end of the line
# and that there's a newline character at the end of the line
$ ruby -lpe '$\ = $<.eof ? "\n" : ","' ip.txt
Hello World,How are you,This game is good,Today is sunny,12345,You are funny

# if there's only one line in input, again make sure there's no trailing ','
# and that there's a newline character at the end of the line
$ printf 'fig' | paste -sd,
fig
$ printf 'fig' | ruby -lpe '$\ = $<.eof ? "\n" : ","'
fig

3) For the input file sample.txt, extract all paragraphs having words starting with do.

$ cat sample.txt
Hello World

Good day
How are you

Just do-it
Believe it

Today is sunny
Not a bit funny
No doubt you like it too

Much ado about nothing
He he he

# note that there's no extra empty line at the end of the output
$ ruby -l -00 -ne '(print $s, $_; $s="\n") if /\bdo/' sample.txt
Just do-it
Believe it

Today is sunny
Not a bit funny
No doubt you like it too

4) For the input file sample.txt, change each paragraph to a single line by joining lines using . and a space character as the separator. Also, add a final . to each paragraph.

# note that there's no extra empty line at the end of the output
$ ruby -F'\n' -00 -lane '$\ = $<.eof ? ".\n" : ".\n\n"; print $F * ". "' sample.txt
Hello World.

Good day. How are you.

Just do-it. Believe it.

Today is sunny. Not a bit funny. No doubt you like it too.

Much ado about nothing. He he he.

5) For the given input, use ;; as the record separators and : as the field separators. Filter records whose second field is greater than 50.

$ s='mango:100;;apple:25;;grapes:75'

# note that the output has ;; at the end, not a newline character
$ printf "$s" | ruby -F: -lane 'BEGIN{$/=$\=";;"}; print if $F[1].to_i > 50'
mango:100;;grapes:75;;

6) The input file f1.txt has varying amount of empty lines between the records. Change them to be always two empty lines. Also, remove empty lines at the start and end of the file.

$ ruby -l -00 -ne 'print $s, $_; $s="\n\n"' f1.txt
hello


world


apple
banana
cherry


tea coffee
chocolate

7) The sample string shown below uses cat as the record separator. Display only the even numbered records separated by a single empty line.

$ s='applecatfigcat12345catbananacatguava:cat:mangocat3'
$ echo "$s" | ruby -lne 'BEGIN{$/ = "cat"}; (print $s, $_; $s="\n") if $.%2==0'
fig

banana

:mango

Multiple file input

1) Print the last field of first two lines for the input files table.txt and ip.txt. Assume space as the field separators for these two files. To make the output more informative, print filenames and a separator as shown in the output below. Assume that the input files will have at least two lines.

# table.txt ip.txt are passed as file inputs
$ ruby -lane 'puts ">#{ARGF.filename}<" if $.==1;
              puts $F[-1];
              (puts "----------"; ARGF.close) if $.==2' table.txt ip.txt
>table.txt<
42
-7
----------
>ip.txt<
World
you
----------

2) For the input files sample.txt, secrets.txt, ip.txt and table.txt, display only the names of files that contain at or fun in the third field. Assume space as the field separator.

# you'll need $F[2] && $F[2].match?(/at|fun/) if you want to use the match? method
$ ruby -lane '(puts ARGF.filename; ARGF.close) if $F[2] =~ /at|fun/
             ' sample.txt secrets.txt ip.txt table.txt
secrets.txt
ip.txt
table.txt

3) Print the first two lines from the input files ip.txt, sample.txt and table.txt. Also, add a separator between the results as shown below (note that the separator isn't present at the end of the output). Assume that the input files will have at least two lines.

$ ruby -pe 'print $s if $.==1; (ARGF.close; $s="---\n") if $.==2
           ' ip.txt sample.txt table.txt
Hello World
How are you
---
Hello World

---
brown bread mat hair 42
blue cake mug shirt -7

4) Print only the second field of the third line, if any, from these input files: ip.txt, sample.txt and copyright.txt. Consider space as the field separator.

$ ruby -ane 'puts $F[1] if $.==3; ARGF.close if ARGF.eof' ip.txt sample.txt copyright.txt
game
day
bla

Processing multiple records

1) For the input file sample.txt, print lines containing do only if the previous line is empty and the line before that contains you.

$ ruby -lne 'print if $p2=~/you/ && $p1==""; $p2=$p1; $p1=$_' sample.txt
Just do-it
Much ado about nothing

2) For the input file sample.txt, match lines containing do or not case insensitively. Each of these terms occur multiple times in the file. The goal is to print only the second occurrences of these terms (independent of each other).

# for reference, here are all the matches
$ grep -i 'do' sample.txt
Just do-it
No doubt you like it too
Much ado about nothing
$ grep -i 'not' sample.txt
Not a bit funny
Much ado about nothing

$ ruby -ne 'BEGIN{d=n=0};
            print if /do/i && (d+=1)==2;
            print if /not/i && (n+=1)==2' sample.txt
No doubt you like it too
Much ado about nothing

3) For the input file sample.txt, print the matching lines containing are or bit as well as n lines around the matching lines. The value for n is passed to the Ruby command as an environment value.

$ n=1 ruby -e 'BEGIN{n=ENV["n"].to_i}; ip=readlines;
               ip.each_with_index { |s, i| c=i-n; c=0 if c<0;
               puts ip[c..i+n] if s.match?(/are|bit/) }' sample.txt
Good day
How are you

Today is sunny
Not a bit funny
No doubt you like it too

# note that the first and last line are empty for this case
$ n=2 ruby -e 'BEGIN{n=ENV["n"].to_i}; ip=readlines;
               ip.each_with_index { |s, i| c=i-n; c=0 if c<0;
               puts ip[c..i+n] if s.match?(/are|bit/) }' sample.txt

Good day
How are you

Just do-it

Today is sunny
Not a bit funny
No doubt you like it too

4) For the input file broken.txt, print all lines between the markers top and bottom. The first Ruby command shown below doesn't work because it is matching till the end of file as the second marker isn't found. Assume that the input file cannot have two top markers without a bottom marker appearing in between and vice-versa.

$ cat broken.txt
top
3.14
bottom
---
top
1234567890
bottom
top
Hi there
Have a nice day
Good bye

# wrong output
$ ruby -ne '$f=false if /bottom/; print if $f; $f=true if /top/' broken.txt
3.14
1234567890
Hi there
Have a nice day
Good bye

# expected output
$ tac broken.txt | ruby -ne '$f=false if /top/; print if $f; $f=true if /bottom/' | tac
3.14
1234567890

5) For the input file concat.txt, extract contents from a line starting with %%% until but not including the next such line. The block to be extracted is indicated by the variable n passed as an environment value.

$ cat concat.txt
%%% addr.txt
How are you
This game is good
Today %%% is sunny
%%% broken.txt
top %%%
1234567890
bottom
%%% sample.txt
Just %%% do-it
Believe it
%%% mixed_fs.txt
pink blue white yellow
car,mat,ball,basket

$ n=2 ruby -ne 'BEGIN{n=ENV["n"].to_i; c=0};
                c+=1 if /\A%%% /; print if c==n' concat.txt
%%% broken.txt
top %%%
1234567890
bottom
$ n=4 ruby -ne 'BEGIN{n=ENV["n"].to_i; c=0};
                c+=1 if /\A%%% /; print if c==n' concat.txt
%%% mixed_fs.txt
pink blue white yellow
car,mat,ball,basket

6) For the input file ruby.md, replace all occurrences of ruby (irrespective of case) with Ruby. But, do not replace any matches between ```ruby and ``` lines (ruby in these markers shouldn't be replaced either). Save the output in out.md.

# can also use: ruby -pe 'gsub(/ruby/i, "Ruby") if !(/```ruby$/../```$/)'
$ ruby -pe '$f=true if /```ruby$/; gsub(/ruby/i, "Ruby") if !$f;
            $f=false if /```$/' ruby.md > out.md

$ diff -sq out.md expected.md
Files out.md and expected.md are identical

7) Print the last two lines for each of the input files ip.txt, sample.txt and table.txt. Also, add a separator between the results as shown below (note that the separator isn't present at the end of the output). Assume that the input files will have at least two lines.

$ ruby -ne '(print $s,$p,$_; $s="---\n") if ARGF.eof; $p=$_' ip.txt sample.txt table.txt
12345
You are funny
---
Much ado about nothing
He he he
---
blue cake mug shirt -7
yellow banana window shoes 3.14

8) For the input file lines.txt, delete the line that comes after a whole line containing ---. Assume that such lines won't occur consecutively.

$ cat lines.txt
Go There
come on
go there
---
2 apples and 5 mangoes
come on!
---
2 Apples
COME ON

$ ruby -ne 'print if $p != "---\n"; $p=$_' lines.txt
Go There
come on
go there
---
come on!
---
COME ON

9) For the input file result.csv, use --- to separate entries with the same name in the first column. Assume that the lines with the same first column value will always be next to each other.

$ cat result.csv
Amy,maths,89
Amy,physics,75
Joe,maths,79
John,chemistry,77
John,physics,91
Moe,maths,81
Ravi,physics,84
Ravi,chemistry,70
Yui,maths,92

$ ruby -F, -ape 'puts "---" if $.>1 && $p != $F[0]; $p=$F[0]' result.csv
Amy,maths,89
Amy,physics,75
---
Joe,maths,79
---
John,chemistry,77
John,physics,91
---
Moe,maths,81
---
Ravi,physics,84
Ravi,chemistry,70
---
Yui,maths,92

10) The input file multisort.csv has two fields separated by the comma character. Sort this file based on the number of : characters in the second field. Use alphabetic order as the tie-breaker if there are multiple lines with the same number of : characters in the second field.

$ cat multisort.csv
papaya,2
apple,4:5:2
mango,100
dark:chocolate,12:32
cherry,1:2:1:4:2:1
almond,3:14:6:28
banana,23:8

$ ruby -e 'puts readlines.sort_by {[_1.split(",")[1].count(":"), _1]}' multisort.csv
mango,100
papaya,2
banana,23:8
dark:chocolate,12:32
apple,4:5:2
almond,3:14:6:28
cherry,1:2:1:4:2:1

Two file processing

1) Use the contents of match_words.txt file to display matching lines from jumbled.txt and sample.txt. The matching criteria is that the second word of lines from these files should match the third word of lines from match_words.txt.

$ cat match_words.txt
%whole(Hello)--{doubt}==ado==
just,\joint*,concession<=nice

# 'concession' is one of the third words from 'match_words.txt'
# and second word from 'jumbled.txt'
$ ruby -rset -ne 'BEGIN{s=Set.new}; words = $_.scan(/\w+/);
                  (s.add(words[2]); next) if ARGV.size==2;
                  print if s.include?(words[1])
                 ' match_words.txt jumbled.txt sample.txt
wavering:concession/woof\retailer
No doubt you like it too

2) Interleave the contents of secrets.txt with the contents of a file passed as stdin in the format as shown below.

$ ruby -ne 'print $s, $_; puts STDIN.gets; $s="---\n"' <table.txt secrets.txt
stag area row tick
brown bread mat hair 42
---
deaf chi rate tall glad
blue cake mug shirt -7
---
Bi tac toe - 42
yellow banana window shoes 3.14

3) The file search_terms.txt contains one search string per line, and these terms have no regexp metacharacters. Construct a solution that reads this file and displays the search terms (matched case insensitively) that were found in every file passed as the arguments after search_terms.txt. Note that these terms should be matched anywhere in the line (so, don't use word boundaries).

$ cat search_terms.txt
hello
row
you
is
at

# ip: search_terms.txt jumbled.txt mixed_fs.txt secrets.txt table.txt oops.txt
$ ruby -rset -lne 'BEGIN{s1=Set.new; s2=Set.new; c=ARGV.size-1};
             (s1.add($_); next) if ARGV.size==c;
             s1.each { |k| s2.add(k) if /#{k}/i };
             (s1 = s1 & s2; s2 = Set.new) if ARGF.eof; END { puts s1.to_a }
             ' search_terms.txt jumbled.txt mixed_fs.txt secrets.txt table.txt oops.txt
row
at

# ip: search_terms.txt ip.txt sample.txt oops.txt
$ ruby -rset -lne 'BEGIN{s1=Set.new; s2=Set.new; c=ARGV.size-1};
             (s1.add($_); next) if ARGV.size==c;
             s1.each { |k| s2.add(k) if /#{k}/i };
             (s1 = s1 & s2; s2 = Set.new) if ARGF.eof; END { puts s1.to_a }
             ' search_terms.txt ip.txt sample.txt oops.txt
hello
you
is

4) For the input file ip.txt, print all lines that contain are and the line that comes after such a line, if any. Use the gets method to construct the solution.

# note that there shouldn't be an empty line at the end of the output
$ ruby -ne '(print; print gets) if /are/' ip.txt
How are you
This game is good
You are funny

Bonus: Will grep -A1 'is' ip.txt give identical results for your solution with is as the search term? If not, why?

No, it will not give identical results because grep will work for overlapping cases too.

5) Replace the third to fifth lines of the input file ip.txt with the second to fourth lines from the file para.txt.

$ ruby -ne 'print if 2..4' para.txt | ruby -pe '
            print STDIN.read if $.==3; $_ = "" if 3..5' ip.txt
Hello World
How are you
Start working on that
project you always wanted
to, do not let it end
You are funny

6) Insert one line from jumbled.txt before every two lines of copyright.txt.

$ ruby -ne 's = $_; print STDIN.gets if $. % 2 == 1; print s' <jumbled.txt copyright.txt
overcoats;furrowing-typeface%pewter##hobby
bla bla 2015 bla
blah 2018 blah
wavering:concession/woof\retailer
bla bla bla
copyright: 2018

7) Use the entire contents of match.txt to search error.txt and replace matching portions with the contents of jumbled.txt. Partial lines should NOT be matched.

$ cat match.txt
print+this
but not that
$ cat error.txt
print+this
but not that or this
print+this
but not that
if print+this
but not that
print+this
but not that

$ ruby -0777 -ne 'ARGV.size==2 ? s=$_ : ARGV.size==1 ? r=$_ :
                  print(gsub(/^#{Regexp.escape(s)}/) {r})
                 ' match.txt jumbled.txt error.txt
print+this
but not that or this
overcoats;furrowing-typeface%pewter##hobby
wavering:concession/woof\retailer
joint[]seer{intuition}titanic
if print+this
but not that
overcoats;furrowing-typeface%pewter##hobby
wavering:concession/woof\retailer
joint[]seer{intuition}titanic

8) Display lines from scores.csv by matching the first field based on a list of names from the names.txt file. Also, change the output field separator to a space character.

$ cat names.txt
Lin
Cy
Ith

$ ruby -rset -F, -lane 'BEGIN{s=Set.new}; (s.add($F[0]); next) if ARGV.size==1;
                        print $F * " " if s.include?($F[0])' names.txt scores.csv
Lin 78 83 80
Cy 97 98 95
Ith 100 100 100

9) The result.csv file has three columns — name, subject and mark. The criteria.txt file has two columns — name and subject. Match lines from result.csv based on the two columns from criteria.txt provided the mark column is greater than 80.

$ cat result.csv
Amy,maths,89
Amy,physics,75
Joe,maths,79
John,chemistry,77
John,physics,91
Moe,maths,81
Ravi,physics,84
Ravi,chemistry,70
Yui,maths,92

$ cat criteria.txt
Amy maths
John chemistry
John physics
Ravi chemistry
Yui maths

$ ruby -rset -F, -lane 'BEGIN{s=Set.new}; (s.add($_.split(" ")); next) if ARGV.size==1;
                        print if s.include?($F[0..1]) && $F[2].to_i>80' criteria.txt result.csv
Amy,maths,89
John,physics,91
Yui,maths,92

10) Insert the contents of hex.txt before a line matching cake of table.txt.

$ ruby -pe 'BEGIN{r = STDIN.read}; print r if /cake/' <hex.txt table.txt
brown bread mat hair 42
start: 0xA0, func1: 0xA0
end: 0xFF, func2: 0xB0
restart: 0xA010, func3: 0x7F
blue cake mug shirt -7
yellow banana window shoes 3.14

11) For the input file ip.txt, replace lines containing are with the contents of hex.txt.

$ ruby -pe 'BEGIN{r = STDIN.read}; $_ = r if /are/' <hex.txt ip.txt
Hello World
start: 0xA0, func1: 0xA0
end: 0xFF, func2: 0xB0
restart: 0xA010, func3: 0x7F
This game is good
Today is sunny
12345
start: 0xA0, func1: 0xA0
end: 0xFF, func2: 0xB0
restart: 0xA010, func3: 0x7F

Dealing with duplicates

1) Retain only the first copy of a line for the input file lines.txt. Case should be ignored while comparing the lines. For example, hi there and HI TheRE should be considered as duplicates.

$ cat lines.txt
Go There
come on
go there
---
2 apples and 5 mangoes
come on!
---
2 Apples
COME ON

# same as: ruby -e 'puts readlines.uniq(&:downcase)' lines.txt
$ ruby -rset -ne 'BEGIN{s=Set.new}; print if s.add?($_.downcase)' lines.txt
Go There
come on
---
2 apples and 5 mangoes
come on!
2 Apples

2) Retain only the first copy of a line for the input file twos.txt. Assume space as the field separator with exactly two fields per line. Compare the lines irrespective of the order of the fields. For example, hehe haha and haha hehe should be considered as duplicates.

$ cat twos.txt
hehe haha
door floor
haha hehe
6;8 3-4
true blue
hehe bebe
floor door
3-4 6;8
tru eblue
haha hehe

# can also use: ruby -rset -lane 'BEGIN{s=Set.new};
#    print if s.add?($F[0] > $F[1] ? $_ : "#{$F[1]} #{$F[0]}")' twos.txt
$ ruby -e 'puts readlines.uniq {_1.split.sort}' twos.txt
hehe haha
door floor
6;8 3-4
true blue
hehe bebe
tru eblue

3) For the input file twos.txt, display only the unique lines. Assume space as the field separator with exactly two fields per line. Compare the lines irrespective of the order of the fields. For example, hehe haha and haha hehe should be considered as duplicates.

$ ruby -lane 'BEGIN{h=Hash.new(0)};
              h[$F[0] > $F[1] ? $_ : "#{$F[1]} #{$F[0]}"] += 1;
              END{ h.each_key{|k| puts k if h[k]==1} }' twos.txt
true blue
hehe bebe
tru eblue