Traverse a given matrix in a spiral pattern, returning all elements in the order you visit them. Essentially, walk around the matrix layer by layer, adding elements to a list.

Determine the number of '1' bits present in the binary representation of a given integer. Essentially, count how many bits are set to one.

Convert a Roman numeral string into its corresponding integer value. The input string will represent a valid Roman numeral.