Comprehensive Python Practice 3

What is time complexity of list.append()?

Which data structure for fast lookups?

What is list comprehension syntax?

Which is NOT a Python sequence?

What does zip() return in Python 3?

What is the default recursion limit?

Which sorts in-place?

What is a generator function?

Which keyword creates generator?

What is time complexity of dict lookup?

Explain the difference between list and generator comprehension.

What is the difference between deep copy and shallow copy?

Explain the map(), filter(), and reduce() functions.

What are Python's built-in data structures? Compare them.

Explain the any() and all() functions.

What is memoization? How to implement it?

Explain itertools module and common functions.

What is the difference between sort() and sorted()?

Explain the collections module: Counter, defaultdict, OrderedDict.

What are Python's time complexities for common operations?

Implement binary search on a sorted list.

Create a custom queue class using collections.deque.

Write a function to flatten nested lists of any depth.

Implement LRU cache using OrderedDict or dict + linked list concept.

Write a function to find all permutations of a string.

Create a priority queue implementation using heapq module.

Predict output: squares = [x**2 for x in range(5)] print(squares)

Find error: gen = (x**2 for x in range(3)) print(len(gen))

Predict output: from functools import reduce result = reduce(lambda a, b: a * b, [1, 2, 3, 4]) print(result)

Find error: def infinite(): n = 0 while True: yield n n += 1 list(infinite())

Predict output: a = [1, 2, 3] b = a.copy() b.append(4) print(a, b)

Find error: import copy a = [[1], [2], [3]] b = copy.copy(a) b[0][0] = 99 print(a)

Predict output: from collections import Counter words = ['apple', 'banana', 'apple', 'cherry', 'banana', 'apple'] c = Counter(words) print(c.most_common(2))

Find error: items = [3, 1, 4, 1, 5] items.sort().reverse() print(items)