Python Python Coding Interview Questions Quiz

This Python quiz prepares you for the coding round of an interview. It tests the Big-O cost of common operations, which data structure fits a problem, and patterns like two pointers, hash map lookups, memoization and binary search.

Hard 10 questions ~8 minutes Pass at 80% Python 3.12

Choose a mode

Playing as a guest: sign in to keep your XP and streak.

Sample question

Question 1 of 10

What is the average time complexity of x in s when s is a set with n items?

Show the answer

C. O(1) Sets and dicts are hash tables, so finding an item takes constant time on average. The same x in s on a list is O(n), because Python checks items one by one.

What this quiz covers

  • Big-O of in, pop and other list, set and dict operations
  • Picking a set, dict, deque or heap for a task
  • Two pointers and the dict-based two-sum
  • Recursion limits and memoization with lru_cache
  • Binary search with bisect

Questions people ask

Do I need an account?

No. Anyone can play. Sign in to keep your XP, streak, badges and history.

Which Python version?

Python 3.12. Every question about output was checked by running the code.

Can I retake it?

Yes. Your best score is kept, and the questions and answers are shuffled each time.