DSA Cheatsheet
List (Dynamic Array) list = [1, 2, 3] Operation Code Time complexity Get / Set element list[i] or list[i] = 3 O(1) Add element list.append(3) O(1) Add at an index list.insert(i, 3) O(n) Pop last element list.pop() O(1) Pop at an index list.pop(i) O(n) Delete element by value list.remove(3) O(n) Search element 3 in x O(n) Find index of element list.index(3) O(n) Use Dictionary [element → index] instead Sort sorted_list = sorted(list, reverse = False) or list....