Restricted category To view older posts, you must first submit an approved post in that category

LinkedIn Python Skills Test Interview Questions (Review your fundamentals!)

These questions were quite challenging for me meaning I clearly didn’t review the fundamentals enough… Hopefully you all don’t make the same mistakes I did :sob:

What is the runtime complexity of searching for an item in a binary search tree?
What is the algorithmic paradigm of merge sort?
Why would you use a decorator?
Why would you use a mixin?
What is the runtime complexity of adding an item to a stack and removing an item from a stack?
What is the purpose of self keyword when defining or calling instance methods?