summaryrefslogtreecommitdiff
path: root/prolog/problems/sets/union_3/en.py
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/sets/union_3/en.py')
-rw-r--r--prolog/problems/sets/union_3/en.py12
1 files changed, 12 insertions, 0 deletions
diff --git a/prolog/problems/sets/union_3/en.py b/prolog/problems/sets/union_3/en.py
new file mode 100644
index 0000000..8257415
--- /dev/null
+++ b/prolog/problems/sets/union_3/en.py
@@ -0,0 +1,12 @@
+id = 128
+name = 'union/3'
+slug = 'find the union of two sets'
+
+description = '''\
+<p><code>union(S1, S2, U)</code>: the list <code>U</code> contains all elements of <code>S1</code> and <code>S2</code>, with no duplicates.</p>
+<pre>
+ ?- union([1,5,2,3], [3,4,8,2], U).
+ U = [1,5,3,4,8,2].
+</pre>'''
+
+hint = {}