Skip to content

Instantly share code, notes, and snippets.

@jgarciabu
Last active July 27, 2017 18:54
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save jgarciabu/70403fa417676ed63f935ee85e23eb7d to your computer and use it in GitHub Desktop.
Save jgarciabu/70403fa417676ed63f935ee85e23eb7d to your computer and use it in GitHub Desktop.
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Thu Jul 27 14:41:13 2017
@author: Jeff Garcia
Take two lists, say for example these two:
a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
and write a program that returns a list that contains only the elements that
are common between the lists (without duplicates). Make sure your program works
on two lists of different sizes.
Extras:
Randomly generate two lists to test this
Write this in one line of Python (don’t worry if you can’t figure this out at
this point - we’ll get to it soon)
"""
import random
a = random.sample(range(1,50), 10)
b = random.sample(range(1,50), 10)
print(list(set([item for item in a if item in b])))
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment