Keyeric · Keyeric · Jun 12, 2020
diff --git a/names/names.py b/names/names.py
@@ -13,10 +13,19 @@
 duplicates = []  # Return the list of duplicates in this data structure
 
 # Replace the nested for loops below with your improvements
-for name_1 in names_1:
-    for name_2 in names_2:
-        if name_1 == name_2:
-            duplicates.append(name_1)
+# for name_1 in names_1:
+#     for name_2 in names_2:
+#         if name_1 == name_2:
+#             duplicates.append(name_1)
+
+def intersection(lst1, lst2): 
+
+    # Use of hybrid method 
+    temp = set(lst2) 
+    lst3 = [value for value in lst1 if value in temp] 
+    return lst3
+
+duplicates = intersection(names_1, names_2)
 
 end_time = time.time()
 print (f"{len(duplicates)} duplicates:\n\n{', '.join(duplicates)}\n\n")

diff --git a/reverse/reverse.py b/reverse/reverse.py
@@ -39,4 +39,11 @@ def contains(self, value):
         return False
 
     def reverse_list(self, node, prev):
-        pass
+        prev = None
+        current = self.head 
+        while(current is not None): 
+            next_node = current.next_node
+            current.next_node = prev 
+            prev = current 
+            current = next_node
+        self.head = prev 
diff --git a/ring_buffer/ring_buffer.py b/ring_buffer/ring_buffer.py
@@ -1,9 +1,21 @@
 class RingBuffer:
     def __init__(self, capacity):
-        pass
+        self.capacity = capacity
+        self.data = []
+        self.current = 0
 
-    def append(self, item):
-        pass
+    def append(self,item):
+        if len(self.data) == self.capacity:
+            print(f"data: {self.data}, current:{self.current}")
+            self.data[self.current] = item
+
+            if [self.current] == [self.capacity-1]:
+                self.current = 0
+            else:
+                self.current += 1
+
+        else:
+            self.data.append(item)
 
     def get(self):
-        pass
+        return self.data