Add the "pangram-grep" hole

JRaspass · JRaspass · commit 2dfbcfe433a4 · 2017-11-30T19:23:00.000Z
Updates #3
diff --git a/routes/hole.go b/routes/hole.go
@@ -16,6 +16,7 @@ var preambles = map[string]string{
 	"fizz-buzz":          `<h1>Fizz Buzz</h1><p>Print the numbers from <b>1</b> to <b>100</b> inclusive, each on their own line.</p><p>If, however, the number is a multiple of <b>three</b> then print <b>Fizz</b> instead, and if the number is a multiple of <b>five</b> then print <b>Buzz</b>.</p><p>For numbers which are multiples of <b>both three and five</b> then print <b>FizzBuzz</b>.</p>`,
 	"happy-numbers":      `<h1>Happy Numbers</h1><p>A happy number is defined by the following sequence: Starting with any positive integer, replace the number by the sum of the squares of its digits in base-ten, and repeat the process until the number either equals 1 (where it will stay), or it loops endlessly in a cycle that does not include 1. Those numbers for which this process ends in 1 are happy numbers, while those that do not end in 1 are sad numbers.<p>For example, 19 is happy, as the associated sequence is:</p><dl><dd>1<sup>2</sup> + 9<sup>2</sup> = 82<dd>8<sup>2</sup> + 2<sup>2</sup> = 68<dd>6<sup>2</sup> + 8<sup>2</sup> = 100<dd>1<sup>2</sup> + 0<sup>2</sup> + 0<sup>2</sup> = 1.</dl><p>Print all the happy numbers from <b>1</b> to <b>200</b> inclusive, each on their own line.</p>`,
 	"odious-numbers":     `<h1>Odious Numbers</h1><p>An odious number is a non-negative number that has an odd number of 1s in its binary expansion.<p>Print all the odious numbers from <b>0</b> to <b>50</b> inclusive, each on their own line.<p>Numbers that are not odious are called <a href=evil-numbers>evil numbers</a>.</p>`,
+	"pangram-grep":       `<h1>Pangram Grep</h1><p>A pangram is a sentence that uses every letter of a given alphabet.<p>Write a program that will receive various sentences as arguments and print those that are valid pangrams.</p>`,
 	"pascals-triangle":   `<h1>Pascal's Triangle</h1><p>Print the first <b>20 rows</b> of Pascal's triangle.</p>`,
 	"pernicious-numbers": `<h1>Pernicious Numbers</h1><p>A pernicious number is a positive number where the sum of its binary expansion is a <a href=prime-numbers>prime number</a>.<p>For example, <b>5</b> is a pernicious number since <b>5 = 101<sub>2</sub></b> and <b>1 + 1 = 2</b>, which is prime.<p>Print all the pernicious numbers from <b>0</b> to <b>50</b> inclusive, each on their own line.</p>`,
 	"prime-numbers":      `<h1>Prime Numbers</h1><p>Print all the prime numbers from <b>1</b> to <b>100</b> inclusive, each on their own line.</p>`,
diff --git a/routes/home.go b/routes/home.go
@@ -64,15 +64,16 @@ func home(w http.ResponseWriter, r *http.Request, _ httprouter.Params) {
 		         WHEN 'prime-numbers'       THEN 8
 		         WHEN 'quine'               THEN 9
 		         WHEN '99-bottles-of-beer'  THEN 10
-		         WHEN 'seven-segment'       THEN 11
-		         WHEN 'sierpiński-triangle' THEN 12
-		         WHEN 'π'                   THEN 13
-		         WHEN 'φ'                   THEN 14
-		         WHEN '𝑒'                   THEN 15
-		         WHEN 'τ'                   THEN 16
-		         WHEN 'arabic-to-roman'     THEN 17
-		         WHEN 'roman-to-arabic'     THEN 18
-		         WHEN 'spelling-numbers'    THEN 19
+		         WHEN 'pangram-grep'        THEN 11
+		         WHEN 'seven-segment'       THEN 12
+		         WHEN 'sierpiński-triangle' THEN 13
+		         WHEN 'π'                   THEN 14
+		         WHEN 'φ'                   THEN 15
+		         WHEN '𝑒'                   THEN 16
+		         WHEN 'τ'                   THEN 17
+		         WHEN 'arabic-to-roman'     THEN 18
+		         WHEN 'roman-to-arabic'     THEN 19
+		         WHEN 'spelling-numbers'    THEN 20
 		         END, row_number`,
 		printHeader(w, r, 200),
 	)
@@ -144,6 +145,8 @@ func home(w http.ResponseWriter, r *http.Request, _ httprouter.Params) {
 				w.Write([]byte(`Fast><a href=happy-numbers>Happy Numbers`))
 			case "odious-numbers":
 				w.Write([]byte(`Fast><a href=odious-numbers>Odious Numbers`))
+			case "pangram-grep":
+				w.Write([]byte(`Medium><a href=pangram-grep>Pangram Grep`))
 			case "pascals-triangle":
 				w.Write([]byte(`Fast><a href=pascals-triangle>Pascal's Triangle`))
 			case "pernicious-numbers":
diff --git a/routes/pangram-grep.go b/routes/pangram-grep.go
@@ -0,0 +1,41 @@
+package routes
+
+import "math/rand"
+
+func pangramGrep() (args []string, out string) {
+	all := [][]string{
+		{"1", "A large fawn jumped quickly over white zinc boxes."},
+		{"1", "A wizard’s job is to vex chumps quickly in fog."},
+		{"1", "Bright vixens jump; dozy fowl quack."},
+		{"0", "Five or six big jet planes zoomed past the tower."},
+		{"1", "Fix problem quickly with galvanized jets."},
+		{"1", "Go, lazy fat vixen; be shrewd, jump quick."},
+		{"1", "Jumpy halfling dwarves pick quartz box."},
+		{"0", "My ex pub quiz crowd gave happy thanks."},
+		{"1", "Pack my box with five dozen liquor jugs."},
+		{"1", "The five boxing wizards jump quickly."},
+		{"1", "The jay, pig, fox, zebra and my wolves quack!"},
+		{"0", "The quick brown fox jumps over a lazy cat."},
+		{"1", "Waxy and quivering, jocks fumble the pizza."},
+		{"1", "When zombies arrive, quickly fax judge Pat."},
+	}
+
+	// Shuffle the whole set.
+	for i := range all {
+		j := rand.Intn(i + 1)
+		all[i], all[j] = all[j], all[i]
+	}
+
+	for _, v := range all {
+		args = append(args, v[1])
+
+		if v[0] == "1" {
+			out += v[1] + "\n"
+		}
+	}
+
+	// Drop the trailing newline.
+	out = out[:len(out)-1]
+
+	return
+}
diff --git a/routes/scores.go b/routes/scores.go
@@ -18,6 +18,7 @@ var holes = [][]string{
 	{"fizz-buzz", "Fizz Buzz"},
 	{"happy-numbers", "Happy Numbers"},
 	{"odious-numbers", "Odious Numbers"},
+	{"pangram-grep", "Pangram Grep"},
 	{"pascals-triangle", "Pascal's Triangle"},
 	{"pernicious-numbers", "Pernicious Numbers"},
 	{"prime-numbers", "Prime Numbers"},
diff --git a/routes/solution.go b/routes/solution.go
@@ -51,6 +51,8 @@ func solution(w http.ResponseWriter, r *http.Request, _ httprouter.Params) {
 
 		// Drop the trailing newline.
 		out.Exp = out.Exp[:len(out.Exp)-1]
+	case "pangram-grep":
+		args, out.Exp = pangramGrep()
 	case "quine":
 		out.Exp = in.Code
 	case "roman-to-arabic":
