implement optimization using list comprehension. set() function as stretch

Author: depadiernos

names/names.py

@@ -18,7 +18,7 @@
 #         if name_1 == name_2:
 #             duplicates.append(name_1)
 
-duplicates = set(names_2).intersection(names_1)
+# duplicates = [ name for name in names_1 if name in names_2]
 
 end_time = time.time()
 print (f"{len(duplicates)} duplicates:\n\n{', '.join(duplicates)}\n\n")
@@ -28,3 +28,5 @@
 # Python has built-in tools that allow for a very efficient approach to this problem
 # What's the best time you can accomplish?  Thare are no restrictions on techniques or data
 # structures, but you may not import any additional libraries that you did not write yourself.
+
+duplicates = set(names_2).intersection(names_1)