diff --git a/snippets/max_n.md b/snippets/max_n.md
new file mode 100644
index 000000000..670a4e284
--- /dev/null
+++ b/snippets/max_n.md
@@ -0,0 +1,14 @@
+### max_n
+
+Returns the `n` maximum elements from the provided list. If `n` is greater than or equal to the provided list's length, then return the original list(sorted in descending order).
+
+Use `list.sort()` combined with the `deepcopy` function from the inbuilt `copy` module to create a shallow clone of the list and sort it in ascending order and then use `list.reverse()` reverse it to make it descending order. Use `[:n]` to get the specified number of elements. Omit the second argument, `n`, to get a one-element array
+
+``` py 
+from copy import deepcopy
+def max_n(arr,n = 1):
+    numbers = deepcopy(arr)
+    numbers.sort()
+    numbers.reverse()
+    return numbers[:n]
+```
\ No newline at end of file
diff --git a/snippets/min_n.md b/snippets/min_n.md
new file mode 100644
index 000000000..4e3ad550c
--- /dev/null
+++ b/snippets/min_n.md
@@ -0,0 +1,13 @@
+### min_n
+
+Returns the `n` minimum elements from the provided list. If `n` is greater than or equal to the provided list's length, then return the original list(sorted in ascending order).
+
+Use `list.sort()` combined with the `deepcopy` function from the inbuilt `copy` module to create a shallow clone of the list and sort it in ascending order. Use `[:n]` to get the specified number of elements. Omit the second argument, `n`, to get a one-element array
+
+``` py 
+from copy import deepcopy
+def min_n(arr,n = 1):
+    numbers = deepcopy(arr)
+    numbers.sort(   )
+    return numbers[:n]
+```
\ No newline at end of file