From e241399e18ff5f4eeb99bab8d4ca1a2f95b7ab63 Mon Sep 17 00:00:00 2001
From: jim <jim@web>
Date: Mon, 9 Feb 2015 18:34:52 -0500
Subject: [PATCH] create page

---
 exercises/assignment3_hint1.mdwn | 7 +++++++
 1 file changed, 7 insertions(+)
 create mode 100644 exercises/assignment3_hint1.mdwn

diff --git a/exercises/assignment3_hint1.mdwn b/exercises/assignment3_hint1.mdwn
new file mode 100644
index 00000000..c222c091
--- /dev/null
+++ b/exercises/assignment3_hint1.mdwn
@@ -0,0 +1,7 @@
+## Comprehensions
+
+3. Using either Kapulet's or Haskell's list comprehension syntax, write an expression that transforms `[3, 1, 0, 2]` into `[3, 3, 3, 1, 2, 2]`.
+
+*Here is a hint*
+
+Define a function `dup (n, x)` that creates a list of *n* copies of `x`. Then use list comprehensions to transform `[3, 1, 0, 2]` into `[[3, 3, 3], [1], [], [2, 2]]`. Then use `join` to "flatten" the result.
-- 
2.11.0