Technical Interview Tips - Technical Interview with Python cheat sheet

• Time complexity
• Big O Exponential 2**n
• Worst case, Big O
• Best scenario
• Average 
• Data structure & algorithms
• Test case: ZeroDivisionError
• Implement function from scratch
• Tree algorithms
• Use pointers while lo < hi : do xyz lo = 0th index hi = len(input)-1
• Language: Java, Python slightly preferred
• Exponential 

Do you get this joke? This TripleByte banner is a clever time complexity joke:

Funny tweet about Big O notation and developer reactions :D lol