Searching, Sorting, and Array Interviews Python practice problems

Locate the first occurrence of a code in an unsorted list.

Return -1 after checking the complete list.

Locate a target in a sorted record list.

Return -1 when a target is larger than every element.

Find the full index range occupied by a repeated target.

Both boundaries are identical when the target appears once.

Sort a small list to practice adjacent swaps.

Exercise the early-exit optimization on sorted input.

Sort a nearly ordered list, a good case for insertion sort.

Exercise the maximum number of shifts for a short list.

Apply a stable divide-and-conquer sort to mixed integers.

Preserve duplicates while ordering signed values.

Sort a general list using recursive partitioning.

Use the equal partition to group repeated values efficiently.

Merge overlapping meeting time blocks.

Treat intervals that meet at an endpoint as one continuous interval.

For every position, multiply all other values.

A zero leaves only its own position with a nonzero product.

Find the value occurring in more than half of the list.

Handle the smallest list with a repeated majority.