Python Data Structures

items.append(value)

items.extend([4, 5, 6])

items.insert(0, value)

subset = items[1:4]

reversed_items = items[::-1]

items.sort(key=str.lower, reverse=False)

ordered = sorted(items)

items.remove(value)

last = items.pop()

count = items.count(value)

theme = settings.get("theme", "light")

items = grouped.setdefault(category, [])

merged = defaults | overrides

config |= extra_config

for key, value in data.items():
    print(key, value)

squares = {n: n * n for n in range(5)}

inverse = {value: key for key, value in mapping.items()}

combined = a | b

common = a & b

only_a = a - b

changed = a ^ b

is_subset = a <= b

from collections import namedtuple
Point = namedtuple("Point", ["x", "y"])
p = Point(10, 20)

from collections import deque
queue = deque(["a", "b"])
queue.append("c")
item = queue.popleft()

from collections import Counter
counts = Counter(words)
common = counts.most_common(3)

from collections import defaultdict
groups = defaultdict(list)
for user in users:
    groups[user["role"]].append(user)

import heapq
heap = []
heapq.heappush(heap, 5)
smallest = heapq.heappop(heap)