Part1

Author: macr

reverse/reverse.py

@@ -47,4 +47,12 @@ def contains(self, value):
 
     def reverse_list(self, node, prev):
         # You must use recursion for this solution
-        pass
+        if node is None:
+            return None
+        if node.next_node is None:
+            self.head = node
+            self.head.next_node = prev
+            return None
+        else:
+            self.reverse_list(node.next_node, node)
+            node.next_node = prev

ring_buffer/ring_buffer.py

@@ -8,25 +8,40 @@ def __init__(self, capacity):
         self.storage = DoublyLinkedList()
 
     def append(self, item):
-        pass
+        if len(self.storage) < self.capacity:
+            self.storage.add_to_tail(item)
+            self.current = self.storage.tail
+        if len(self.storage) == self.capacity:
+            self.current.value = item
+            if self.current is self.storage.tail:
+                self.current = self.storage.head
+            else:
+                self.current = self.current.next
 
     def get(self):
         # Note:  This is the only [] allowed
         list_buffer_contents = []
 
         # TODO: Your code here
-
+        current = self.storage.head
+        while current:
+            list_buffer_contents.append(current.value)
+            current = current.next
         return list_buffer_contents
 
 # ----------------Stretch Goal-------------------
 
 
 class ArrayRingBuffer:
     def __init__(self, capacity):
-        pass
+        self.capacity = capacity
+        self.current = 0
+        self.storage = [None] * capacity
 
     def append(self, item):
-        pass
+        self.current = self.current % self.capacity
+        self.storage[self.current] = item
+        self.current += 1
 
     def get(self):
-        pass
+        return [i for i in self.storage if i != None]