l1 = [1,2,3,4,1,2,3,5,6,7,3,5,9]
print(set([x for x in l1 if l1.count(x) > 1]))
l1 = [1,2,3,4]
''' using reverse() '''
l1.reverse() # l1 = [4,3,2,1]
''' using slicing '''
l2 = l1[::-1] # l2 = [4,3,2,1]
''' using reversed() '''
l3 = list(reversed(l1)) # l3 = [4,3,2,1]
''' using conventional looping '''
l4 = []
for i in range(len(l1), -1, -1):
l4.append(l1[i])
l1 = [1,2,3,4,1,2,3,5,6,7,3,5,9]
''' using set '''
l2 = list(set(l1)) # l2 = [1,2,3,4,5,6,7,9]
''' using set with lambda '''
rem_duplicate = lambda arr:set(arr)
l3 = list(rem_duplicate(l1)) # l3 = [1,2,3,4,5,6,7,9]
''' using conventional looping '''
l3 = []
for ele in l1:
if ele not in l3:
l3.append(ele)
# l3 = [1,2,3,4,5,6,7,9]
class Stack:
def __init__(self):
self.items = []
def isEmpty(self):
return not self.items
def push(self, item):
self.items.append(item)
def pop(self):
return self.items.pop()
def peek(self):
return self.items[-1]
def size(self)
return len(self.items)
def __str__(self):
return str(self.items)
from collection import deque
class Queue:
def __init__(self):
self.items = deque
def isEmpty(self):
return not self.items
def enqueue(self, ele):
self.items.append(ele)
def dequeue(self):
return self.items.popleft()
def size(self):
return len(self.items)
def peek(self)
return self.items[0]
def __str__(self):
return str(self.items)