aboutsummaryrefslogtreecommitdiff
path: root/challenge-001/abigail/README.md
blob: 363ae8067d8d89f719fe92271cfad606da407428 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
# Solutions by Abigail

## [Challenge #1](https://perlweeklychallenge.org/blog/perl-weekly-challenge-001/#challenge-1)

Write a script to replace the character `e` with `E` in the string
`"Perl Weekly Challenge"`. Also print the number of times the character
`e` is found in the string.

### Note
We will not be assuming a fixed string. Instead, we read from STDIN,
and for each line read, we change the 'e' characters to 'E', and
count the number of time we encountered an 'e'.

### Solutions
* [AWK](awk/ch-1.awk)
* [Bash](bash/ch-1.sh)
* [Befunge-93](befunge/ch-1.bf93)
* [C](c/ch-1.c)
* [Go](go/ch-1.go)
* [Java](java/ch-1.java)
* [lua](lua/ch-1.lua)
* [Node.js](node/ch-1.js)
* [Pascal](pascal/ch-1.p)
* [Perl](perl/ch-1.pl)
* [Python](python/ch-1.py)
* [R](r/ch-1.r)
* [Ruby](ruby/ch-1.rb)
* [Tcl](tcl/ch-1.tcl)
* [Scheme](scheme/ch-1.scm)


## [Challenge #2](https://perlweeklychallenge.org/blog/perl-weekly-challenge-001/#challenge-2)

Write a one-liner to solve the *FizzBuzz* problem and print the
numbers `1` through `20`. However, any number divisible by `3` should
be replaced by the word `fizz` and any divisible by `5` by the word
`buzz` Those numbers that are both divisible by `3` and `5` become
`fizzbuzz`.

### Note
We will not be assuming a fixed upper bound. Instead, we read the
upper bound from STDIN.

### Solutions
* [AWK](awk/ch-2.awk)
* [Bash](bash/ch-2.sh)
* [Befunge-93](befunge-93/ch-2.bf93)
* [bc](bc/ch-2.bc)
* [C](c/ch-2.c)
* [Go](go/ch-2.go)
* [Java](java/ch-2.java)
* [lua](lua/ch-2.lua)
* [Node.js](node/ch-2.js)
* [Pascal](pascal/ch-2.p)
* [Perl](perl/ch-2.pl)
* [Python](python/ch-2.py)
* [R](r/ch-2.r)
* [Ruby](ruby/ch-2.rb)
* [Tcl](tcl/ch-2.tcl)
* [Scheme](scheme/ch-2.scm)