What will be the output of the code snippet below?
x = [1, 2, 3]
y = x[::-1]
print(x is y, x == y[::-1])
Slicing x[::-1] creates a new inverted list object y = [3, 2, 1]. x is y is False because they are distinct memory objects. x == y[::-1] is True because [3, 2, 1][::-1] equals [1, 2, 3].
Evaluate the output of the expression sum(range(1, 10, 2)):
range(1, 10, 2) produces sequence: 1, 3, 5, 7, 9. Sum = 1 + 3 + 5 + 7 + 9 = 25.
What will happen when executing the following snippet?
a = [1, 2]
a[len(a):] = [3, 4]
print(a)
Assigning to slice a[len(a):] is equivalent to extending a at the end with the elements of the assigned iterable [3, 4], resulting in [1, 2, 3, 4].
What value is printed by print(a[0][1] + a[1][0]) given a = [[1, 2], [3, 4]]?
a[0][1] is 2. a[1][0] is 3. 2 + 3 = 5.
What is the average time complexity of accessing an element at a known index L[i] in a Python list?
Python lists are implemented as dynamic arrays of pointers, allowing constant time O(1) random access by index.