sandy_heron_7722

The Bouncer

Given sorted_nums = [1, 4, 7, 12, 18, 23], use bisect.insort to insert 10

Use bisect.insort to build a sorted list from the unsorted values [5, 2, 8, 1, 9, 3]

Import bisect

Create a deque from [1, 2, 3]

Create a deque with maxlen=4

Use heapq.nsmallest and heapq.nlargest to find the 3 smallest and 3 largest values from [15, 3, 28,

Import heapq

Append "python" to the "languages" list inside the dev dictionary

Create a copy of base using .copy(), then use .update() to merge overrides into the copy