Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #a=[(4,5),(9,10),(2,100)]
- a=["abcd","efga","xyz"]
- def func(a):
- final=set(list(a[0]))
- for i in range(1,len(a)):
- final=final.intersection(list(a[i]))
- print(final)
- return len(final)==0
- print(func(a))
- list append:O(1)
- delete:O(n)
- pop(index):O(n)
- pop(last):O(1)
- dictionary k,v:
- add:O(1)
- pop :avg case O(1)
- if i in d:O(1)
- set k:
- add O(1)
- pop O(1)
- if i in d:O(1)
- deque:
- appendright:O(1)
- appendleft:O(1)
- popleft:O(1)
- poprigth:O(1)
- max-heap
- add:O(log n)
- pop:O(log n)
- max:O(1)
- delete;O(log n)
- min-heap
- add:O(log n)
- pop:O(log n)
- min:O(1)
- delete;O(log n)
- stack:
- push;O(1)
- pop:O(1)
- queue:
- enquee;O(1)
- deque:O(1)
Advertisement
Add Comment
Please, Sign In to add comment