Things-I-learned-so-far.md

This is what i learned about Python while trying to approach the optimal solution

how does python "in" operator works and what its BigO
- complexity of in operator in python
- how is the in operator implemented
Python sorted() uses Timsort algorthim which is O(N*LogN)
- sorted time complexity
- TimeSort Algorthim
String slicing is O(N^2) since it is simply copying
- Time complexity of string slice
.join() O(N) is faster than += O(N^2) for strings
- Why is ''.join() faster than += in Python?
- Time complexity of += and .join()
set.difference() is O(N) and i guess set(A)^set(B) is O(N^2)
- run time of the set difference
collections.deque() is better for stacks if we don't care about the internal indexing as it is a double linked lists, but list might be better if the stack size will be small and we intend to access other elemetns inside the stack
- how to implment stacks in python