Iam_Sandeep

Untitled

Sep 14th, 2022
959
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.67 KB | None | 0 0
  1. #a=[(4,5),(9,10),(2,100)]
  2. a=["abcd","efga","xyz"]
  3. def func(a):
  4.     final=set(list(a[0]))
  5.     for i in range(1,len(a)):
  6.         final=final.intersection(list(a[i]))
  7.     print(final)
  8.     return len(final)==0
  9.    
  10.  
  11. print(func(a))
  12.  
  13. list append:O(1)
  14. delete:O(n)
  15. pop(index):O(n)
  16. pop(last):O(1)
  17.  
  18. dictionary k,v:
  19. add:O(1)
  20. pop :avg case O(1)
  21. if i in d:O(1)
  22.  
  23. set k:
  24. add O(1)
  25. pop O(1)
  26. if i in d:O(1)
  27.  
  28.  
  29. deque:
  30. appendright:O(1)
  31. appendleft:O(1)
  32. popleft:O(1)
  33. poprigth:O(1)
  34.  
  35. max-heap
  36. add:O(log n)
  37. pop:O(log n)
  38. max:O(1)
  39. delete;O(log n)
  40.  
  41.  
  42. min-heap
  43. add:O(log n)
  44. pop:O(log n)
  45. min:O(1)
  46. delete;O(log n)
  47.  
  48. stack:
  49. push;O(1)
  50. pop:O(1)
  51.  
  52. queue:
  53. enquee;O(1)
  54. deque:O(1)
Advertisement
Add Comment
Please, Sign In to add comment