Ruby solution for week 111, part 2

1 files changed, 34 insertions, 0 deletions

diff --git a/challenge-111/abigail/ruby/ch-2.rb b/challenge-111/abigail/ruby/ch-2.rb
new file mode 100644
index 0000000000..afe0361969
--- /dev/null
+++ b/challenge-111/abigail/ruby/ch-2.rb
@@ -0,0 +1,34 @@
+#!/usr/bin/ruby
+
+#
+# See ../README.md
+#
+ 
+#
+# Run as: ruby ch-2.rb < input-file
+#
+
+#
+# Create a pattern to match words with their characters in
+# lexicographical order.
+#
+pat = "^"
+("a" .. "z") . each do
+    |letter|
+    pat += letter + "*"
+end
+pat += "$"
+
+
+#
+# Find matching words, and remember the longest.
+#
+longest = ""
+ARGF . each_line do
+    |line|
+    if line . downcase =~ /#{pat}/ && line . length > longest . length
+        longest = line
+    end
+end
+
+puts (longest)