completed list-1 problems

Author: saurabhmithe

Solutions/list-1/has23.py

@@ -0,0 +1,10 @@
+# Given an int array length 2, return
+# True if it contains a 2 or a 3.
+
+# has23([2, 5]) → True
+# has23([4, 3]) → True
+# has23([4, 5]) → False
+
+
+def has23(nums):
+    return 2 in nums or 3 in nums

Solutions/list-1/make_ends.py

@@ -0,0 +1,11 @@
+# Given an array of ints, return a new array length 2 containing
+# the first and last elements from the original array.
+# The original array will be length 1 or more.
+
+# make_ends([1, 2, 3]) → [1, 3]
+# make_ends([1, 2, 3, 4]) → [1, 4]
+# make_ends([7, 4, 6, 2]) → [7, 2]
+
+
+def make_ends(nums):
+    return [nums[0], nums[-1]]

Solutions/list-1/middle_way.py

@@ -0,0 +1,10 @@
+# Given 2 int arrays, a and b, each length 3, return a new
+# array length 2 containing their middle elements.
+
+# middle_way([1, 2, 3], [4, 5, 6]) → [2, 5]
+# middle_way([7, 7, 7], [3, 8, 0]) → [7, 8]
+# middle_way([5, 2, 9], [1, 4, 5]) → [2, 4]
+
+
+def middle_way(a, b):
+    return [a[1], b[1]]